Abstract
The k -generalized Fibonacci sequence ( F n ( k ) ) n resembles the Fibonacci sequence in that it starts with 0 , … , 0 , 1 ( k terms) and each term afterwards is the sum of the k preceding terms. In this paper, we are interested in finding the integers that appear in different generalized Fibonacci sequences; i.e., we study the Diophantine equation F n ( k ) = F m ( ℓ ) in positive integers n , k , m , ℓ with k , ℓ ⩾ 2 .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
