Abstract
A generalization of the well-known Fibonacci sequence is the Fibonacci sequence whose first k terms are 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 . 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.