Abstract
The Fibonacci sequence is a source of many nice and interesting identities. A similar interpretation exists for Lucas sequence. The Fibonacci sequence, Lucas numbers and their generalization have many interesting properties and applications to almost every field. Fibonacci sequence is defined by the recurrence formula and F0=0, F1=1, where Fn is a nth number of sequence. The Lucas Sequence is defined by the recurrence formula and L0=2, L1=1, where Ln is a nth number of sequence. In this paper, Generalized Fibonacci-Lucas sequence is introduced and defined by the recurrence relation with B0 = 2b, B1 = s, where b and s are integers. We present some standard identities and determinant identities of generalized Fibonacci-Lucas sequences by Binet’s formula and other simple methods.
Sign-in/Register to access full text options 
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
