Eric F. Bravo, Jhon J. Bravo, Carlos A. Gómez
Published 2020-08-21Version 1
A generalization of the well--known Fibonacci sequence is the $k$--Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,\ldots,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 concatenations of two repdigits. This generalizes prior results which dealt with the above problem for the particular cases of Fibonacci and Tribonacci numbers.
Powers of two as sums of two $k-$Fibonacci numbers
On the multiplicity in Pillai's problem with Fibonacci numbers and powers of a fixed prime
On the possible quantities of Fibonacci numbers that occur in some type of intervals
![QR code for arXiv:2008.09698 [math.NT]](http://oss.arxitics.com/images/favicon.svg)