Abstract

We consider the general second order recurrence relation $$ {A_{{n + 1}}} = a{A_n} = b{A_{{n - 1}}},\;n \in Z, $$ (1) where a, b ∈ C are fixed, with b non-zero. For any choice of initial values A0, A1 ∈ C there is a unique sequence {An} satisfying (1). The special case of the recurrence relation (1) for which a a = - b = 1 generates the Fibonacci and Lucas numbers, where respectively A0 = 0, A1 = 1 and A0 = 2, A1 = 1. Many of the well known identities involving the Fibonacci and Lucas numbers are readily generalized to any sequence {An} satisfying (1). (See, for example, Vajda [2], Walton and Horadam [3].)

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.