Pillai's problem with k-Fibonacci and Pell numbers.

The k-Fibonacci sequence { F n (k) } n starts with the values 0 , ... , 0 , 1 (a total of k terms) and each term afterwards is the sum of the k preceding terms. In this paper, we find all integers c having at least two representations as a difference between a k-Fibonacci number and a Pell number. This paper continues and extends the previous work of [J.J. Bravo, C.A. Gómez, and J.L. Herrera, On the intersection of k-Fibonacci and Pell numbers, Bull. Korean Math. Soc. 56(2) (2019), pp. 535–547; S. Hernández, F. Luca, and L.M. Rivera, On Pillai's problem with the Fibonacci and Pell sequences, Soc. Mat. Mex. 25 (2019), pp. 495–507 and M.O. Hernane, F. Luca, S.E. Rihane, and A. Togbé, On Pillai's problem with Pell numbers and powers of 2, Hardy- Ramanujan J. 41 (2018), pp. 22–31]. [ABSTRACT FROM AUTHOR]