Type: Article
Publication Date: 2021-10-15
Citations: 2
DOI: https://doi.org/10.3390/math9202588
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.
| Action | Title | Year | Authors |
|---|