Generalized Fibonacci-Lucas Sequence

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 F₀=0, F₁=1, where Fn is a nthnumber of sequence. The Lucas Sequence is defined by the recurrence formula and L₀=2, L₁=1, where Ln is a nthnumber of sequence. In this paper, Generalized Fibonacci-Lucas sequence is introduced and defined by the recurrence relation with B₀ = 2b, B₁ = 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.