Curious Generalized Fibonacci Numbers
A generalization of the well-known Fibonacci sequence is the k−Fibonacci sequence whose first k terms are 0,…,0,1 and each term afterwards is the sum of the preceding k terms. In this paper, we find all k-Fibonacci numbers that are curious numbers (i.e., numbers whose base ten representation have the form a⋯ab⋯ba⋯a). This work continues and extends the prior result of Trojovský, who found all Fibonacci numbers with a prescribed block of digits, and the result of Alahmadi et al., who searched for k-Fibonacci numbers, which are concatenation of two repdigits.
2020 ◽
Vol 16
(07)
◽
pp. 1643-1666
1980 ◽
Vol 11
(2)
◽
pp. 197-200
2005 ◽
Vol 20
(20n21)
◽
pp. 4797-4819
◽
2012 ◽
Vol 160
(9)
◽
pp. 1399-1405
◽