@article{tjant2014261,
author={{Singh, Bijendra and Sikhwal, Omprakash and Gupta, Yogesh Kumar},
title={Generalized Fibonacci-Lucas Sequence},
journal={Turkish Journal of Analysis and Number Theory},
volume={2},
number={6},
pages={193--197},
year={2014},
url={http://pubs.sciepub.com/tjant/2/6/1},
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 <img src=image/abs1.png></img>and F<SUB>0</SUB>=0, F<SUB>1</SUB>=1, where F<SUB>n</SUB> is a n<SUP>th </SUP>number of sequence. The Lucas Sequence is defined by the recurrence formula <img src=image/abs2.png></img> and L<SUB>0</SUB>=2, L<SUB>1</SUB>=1, where L<SUB>n</SUB> is a n<SUP>th </SUP>number of sequence. In this paper, Generalized Fibonacci-Lucas sequence is introduced and defined by the recurrence relation <img src=image/abs3.png></img> with B<SUB>0</SUB> = 2b, B<SUB>1</SUB> = 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.},
doi={10.12691/tjant-2-6-1}
publisher={Science and Education Publishing}
}