For k ≥ 2, the k-generalized Fibonacci sequence is defined to have the initial k terms 0,0,...,0,1 and be such that each term afterwards is the sum of the k preceding terms. We will prove that the number of solutions of the Diophantine equation (under some weak assumptions) is bounded by an effectively computable constant depending only on c.
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-cm134-2-10, author = {Diego Marques}, title = {On the spacing between terms of generalized Fibonacci sequences}, journal = {Colloquium Mathematicae}, volume = {135}, year = {2014}, pages = {267-280}, zbl = {06285564}, language = {en}, url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-cm134-2-10} }
Diego Marques. On the spacing between terms of generalized Fibonacci sequences. Colloquium Mathematicae, Tome 135 (2014) pp. 267-280. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-cm134-2-10/