A Diophantine equation in k-Fibonacci numbers and repdigits
Colloquium Mathematicum, Volume 152, No. 2, Year 2018
Notification
URL copied to clipboard!
The k-generalized Fibonacci sequence {Fn(k)}n starts with the k values 0, …, 0, 1 and each term afterwards is the sum of the k preceding terms. We study which members of this sequence are sums of two repdigts, extending a result of Díaz and Luca (2011) regarding Fibonacci numbers with this property.