Abstract
We will explore the generalization of the four different 2-Fibonacci sequences defined by Atanassov. In particular, we will define recurrence relations to generate each part of a 2-Fibonacci sequence, discuss the generating function and Binet formula of each of these sequences, and provide the necessary and sufficient conditions to obtain each type of Binet formula.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
