@article{tjant2014253,
author={{Singh, Mamta and Sikhwal, Omprakash and Gupta, Yogesh Kumar},
title={Identities of Generalized Fibonacci-Like Sequence},
journal={Turkish Journal of Analysis and Number Theory},
volume={2},
number={5},
pages={170--175},
year={2014},
url={http://pubs.sciepub.com/tjant/2/5/3},
abstract={The Fibonacci and Lucas sequences are well-known examples of second order recurrence sequences. 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 F<SUB>n</SUB>=F<SUB>n-1</SUB>+F<SUB>n-2</SUB>, n¡Ý2 and F<SUB>0</SUB>=0, F<SUB>1</SUB>=1, where F<SUB>n</SUB> is a n<SUP>th</SUP><SUP> </SUP>number of sequence. Many authors have defined Fibonacci pattern based sequences which are popularized and known as Fibonacci-Like sequences. In this paper, Generalized Fibonacci-Like sequence is introduced and defined by the recurrence relation M<SUB>n</SUB>=M<SUB>n-1</SUB>+M<SUB>n-2</SUB>, n¡Ý2, with M<SUB>0</SUB>=2, M<SUB>1</SUB>=s+1, where s being a fixed integers. Some identities of Generalized Fibonacci-Like sequence are presented by Binet¡¯s formula. Also some determinant identities are discussed.},
doi={10.12691/tjant-2-5-3}
publisher={Science and Education Publishing}
}