On Terms of Generalized Fibonacci Sequences which are Powers of their Indexes
Keyword(s):
The k-generalized Fibonacci sequence ( F n ( k ) ) n (sometimes also called k-bonacci or k-step Fibonacci sequence), with k ≥ 2 , is defined by the values 0 , 0 , … , 0 , 1 of starting k its terms and such way that each term afterwards is the sum of the k preceding terms. This paper is devoted to the proof of the fact that the Diophantine equation F m ( k ) = m t , with t > 1 and m > k + 1 , has only solutions F 12 ( 2 ) = 12 2 and F 9 ( 3 ) = 9 2 .
Keyword(s):
Keyword(s):
1966 ◽
Vol 18
◽
pp. 332-349
◽
2020 ◽
Vol 26
(11-12)
◽
pp. 1564-1578
2019 ◽
Vol 8
(12)
◽
pp. 453-455