Answers are grounded in this paper and cite their sources.
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 Fn=Fn-1+Fn-2, nâ¥2 and F₀=0, F₁=1, where Fn is a nthnumber 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 Mn=Mn-1+Mn-2, nâ¥2, with M₀=2, M₁=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.
No takes yet. Share an insight, caveat, or question.
Singh et al. (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: