eng Science and Education Publishing Turkish Journal of Analysis and Number Theory 2014-12-28 2 6 233 238 10.12691/tjant-2-6-9 TJANT2014269 article Yogesh Kumar Gupta yogeshgupta.880@rediffmail.com 1 Mamta Singh 2 Omprakash Sikhwal 3 Schools of Studies in Mathematics, Vikram University Ujjain, (M. P.) India Department of Mathematical Sciences and Computer application, Bundelkhand University, Jhansi (U. P.) Department of Mathematics, Mandsaur Institute of Technology, Mandsaur (M. P.) India 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 Fn=Fn-1+Fn-2, , and F0=0, F1=1, where Fn is a nth number of sequence. Many authors have been 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 Bn=Bn-1+Bn-2, with B0=2s, B1=s+1, where s being a fixed integers. Some identities of Generalized Fibonacci-Like sequence associated with Fibonacci and Lucas sequences are presented by Binet's formula. Also some determinant identities are discussed. http://pubs.sciepub.com/tjant/2/6/9/tjant-2-6-9.pdf Fibonacci sequence Lucas sequence Generalized Fibonacci-Like Sequence Binet's formula