1. Introduction
Fibonacci numbers Fn and Lucas numbers L_{n} have delighted mathematicians and amateurs alike for centuries with their beauty and their propensity to pop up in quite unexpected places ^{[3]}, ^{[12]} and ^{[13]}. It is well known that generalized Fibonacci and Lucas numbers play an important role in many subjects such as algebra, geometry, and number theory. Their various elegant properties and wide applications have been studied by many authors.
The Fibonacci and Lucas sequences are examples of second order recursive sequences. The Fibonacci sequence ^{[4]} is defined by the recurrence relation:
 (1.1) 
The similar interpretation also exists for Lucas sequence. Lucas sequence ^{[4]} is defined by the recurrence relation:
 (1.2) 
Authors ^{[1, 2, 3, 4]} and [613]^{[6]} have been generalized second order recurrence sequences by preserving the recurrence relation and altering the first two terms of the sequence, while others have generalized these sequences by preserving the first two terms of sequence but altering the recurrence relation slightly.
Horadam ^{[1]} introduced and studied properties of a generalized Fibonacci sequenceand defined generalized Fibonacci sequence by the recurrence relation:
 (1.3) 
where are arbitrary integers.
Horadam ^{[2]} introduced and studied properties of another generalized Fibonacci sequence and defined generalized Fibonacci sequence by the recurrence relation:
 (1.4) 
where are arbitrary integers.
Waddill and Sacks ^{[10]} extended the Fibonacci numbers recurrence relation and defined the sequence by recurrence relation:
 (1.5) 
where and are not all zero given arbitrary algebraic integers.
Jaiswal ^{[5]} introduced and studied properties of generalized Fibonacci sequenceand defined it by
 (1.6) 
Falcon and Plaza ^{[11]} introducedFibonacci sequenceand studied its properties. For any positive integer, Fibonacci sequence is defined by
 (1.7) 
In this paper we present Generalized FibonacciLucas sequence and some specific identities and some determinant identities.
2. Generalized FibonacciLucas Sequence
Generalized FibonacciLucas sequence is introduced and defined by recurrence relation:
 (2.1) 
where b and s are non negative integers.
The first few terms are as follows:
The characteristic equation of recurrence relation (2.1) is which has two real roots
 (2.2) 
Also,
Generating function of generalized FibonacciLucas sequence is
 (2.3) 
Binet’s formula of Generalized FibonacciLucas sequence is defined by
 (2.4) 
Here,
Also, and
Generalized FibonacciLucas Sequence generates many classical sequences on the basis of value of b and s.
3. Identities of Generalized FibonacciLucas Sequence
Now some identities of generalized FibonacciLucas sequence are present using generating function and Binet’s formula. Authors ^{[6, 7]} have been described such type identities.
Theorem (3.1). (Explicit Sum Formula) Let be the term of generalized FibonacciLucas sequence. Then
 (3.1) 
Proof. By generating function (2.3), we have
Equating the coefficient of we obtain
By taking different values of b and s in above identity, explicit formulas can be obtained for Fibonacci and Lucas sequences.
Theorem (3.2). (Sum of First terms) Sum of first terms of Generalized FibonacciLucas sequence is
 (3.2) 
Proof. Using the Binet’s formula (2.4), we have
Using subsequent results of Binet’s formula, we get
Theorem (3.3). (Sum of First terms with odd indices): Sum of first terms (with odd indices) of Generalized FibonacciLucas sequence is
 (3.3) 
Proof. Using the Binet’s formula (2.4), we have
Using subsequent results of Binet’s formula, we get
Theorem (3.4). (Sum of First terms with even indices) Sum of first terms (with even indices) of generalized FibonacciLucas sequence is given by
 (3.4) 
Proof. Using the Binet’s formula (2.4), we have
Using subsequent results of Binet’s formula, we get
Theorem (3.5). (Catalan’s Identity) Let be the term of Generalized FibonacciLucas sequence. Then
 (3.5) 
Proof. Using Binet’s formula (2.4), we have
Using subsequent results of Binet’s formula, we get
Corollary (3.5.1). (Cassini’s Identity) Let be the term of Generalized FibonacciLucas sequence. Then
 (3.6) 
Taking in the Catalan’s identity (3.5), the required identity is obtained.
Theorem (3.6). (d’Ocagne’s Identity) Let be the term of generalized FibonacciLucas sequence. Then
 (3.7) 
Proof. Using Binet’s formula (2.4), we have
Using subsequent results of Binet’s formula, we get
Theorem (3.7). (Generalized Identity) Let be the term of Generalized FibonacciLucas sequence. Then
 (3.8) 
Proof. Using Binet’s formula (2.4), we have
Using subsequent results of Binet’s formula, we get
We obtain,
The identity (3.8) provides Catalan’s, Cassini’s and d’Ocagne’s and other identities:
(i) If m=n, the Catalan’s identity (3.5) is obtained.
(ii) If m=n and in identity (3.8), the Cassini’s identity (5.1) is obtained.
(iii) If n=m, m= and in identity (3.8), the d’Ocagne’s identity (3.6) is obtained.
4. Determinant Identities
There is a long tradition of using matrices and determinants to study Fibonacci numbers. T. Koshy ^{[10]} explained two chapters on the use of matrices and determinants. In this section, some determinant identities are presented.
Theorem(4.1). For any integers , prove that
 (4.1) 
Proof.
Applying , we get
Since two columns are identical,we obtained required result.
Theorem (4.2). For any integer , prove that
 (4.2) 
Proof.
By applying and expanding along first row, we obtained required result.
Theorem (4.3). For any integer , prove that
 (4.3) 
Proof.
Applying,, we get
Taking common out from third row,
Since two rows are identical, thus we obtained required result.
Theorem (4.4). For any integer , prove that
 (4.4) 
Proof.
Let
Applying , we get
Applying and expanding along first row, we obtained required result.
Theorem (4.5). For any integer , prove that
 (4.5) 
Proof.
Let
Taking common out from respectively, we get
Taking common out from respectively and expanding along first row, we obtained required result.
Theorem (4.6). For any integer, prove that
 (4.6) 
Proof: Let
Assume B_{n} = a, B_{n+1 }= b, B_{n+2 }= a + b and F_{n} = p, F_{n+1}= q, F_{n+2 }= p + q.
Now substituting the above values in determinant, we get
Applying
Applying
Substituting the values of a, b, p and q, we get required result.
Similarly following identities can be derived:
Theorem (4.8). For any integer , prove that
 (4.8) 
Theorem (4.9). For any integer , prove that
 (4.9) 
Theorem 4.(10). For any integer , prove that
 (4.10) 
5. Conclusions
In this paper, Generalized FibonacciLucas sequence is introduced. Some standard identities of generalized FibonacciLucas sequence have been obtained and derived using generating function and Binet’s formula. Also some determinant identities have been established and derived.
References
[1]  A. F. Horadam: A Generalized Fibonacci Sequence, American Mathematical Monthly, Vol. 68. (5), 1961, 455459. 
 In article  CrossRef 

[2]  A. F. Horadam: Basic Properties of a Certain Generalized Sequence of Numbers, The Fibonacci Quarterly, Vol. 3 (3), 1965, 161176. 
 In article  

[3]  A.T. Benjamin and D. Walton: Counting on Chebyshev polynomials, Math. Mag. 82, 2009, 117126. 
 In article  CrossRef 

[4]  B. Singh, O. Sikhwal and S. Bhatnagar: FibonacciLike Sequence and its Properties, Int. J. Contemp. Math. Sciences, Vol. 5 (18), 2010, 859868. 
 In article  

[5]  B. Singh, S. Bhatnagar and O. Sikhwal: FibonacciLike Polynomials and some Identities, International Journal of Advanced Mathematical Sciences, 1 (3), (2013) 152157. 
 In article  

[6]  B. Singh, S. Bhatnagar and O. Sikhwal: FibonacciLike Sequence, International Journal of Advanced Mathematical Sciences, 1 (3) (2013) 145151. 
 In article  

[7]  B. Singh, S. Bhatnagar and O. Sikhwal: Generalized Identties of Companion FibonacciLike Sequences, Global Journal of Mathematical Analysis, 1 (3), 2013, 104109. 
 In article  

[8]  D. V. Jaiswal: On a Generalized Fibonacci Sequence, Labdev J. Sci. Tech. Part A 7, 1969, 6771. 
 In article  

[9]  M. Edson and O. Yayenie: A New Generalization of Fibonacci sequence and Extended Binet’s Formula, Integers Vol. 9, 2009, 639654. 
 In article  CrossRef 

[10]  M. E. Waddill and L. Sacks: Another Generalized Fibonacci Sequence, The Fibonacci Quarterly, Vol. 5 (3), 1967, 209222. 
 In article  

[11]  S. Falcon and A. Plaza: On the Fibonacci K Numbers, Chaos, Solutions & Fractals, Vol. 32 (5), 2007, 16151624, 
 In article  CrossRef 

[12]  S. Vajda, Fibonacci & Lucas Numbers, and the Golden Section, Theory and Applications, Ellis Horwood Ltd., Chichester, 1989. 
 In article  

[13]  T. Koshy, Fibonacci and Lucas Numbers with Applications, WileyInterscience Publication, New York (2001). 
 In article  
