Abstract
We consider the general second order recurrence relation
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].)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Freitag, H. T. and Phillips, G. M. “On Co-related Sequences Involving Generalized Fibonacci Numbers.” Applications of Fibonacci Numbers, Volume 4. Edited by G. E. Bergum, A. N. Philippou, and A. F. Horadam. Kluwer Academic Publishers, Dordrecht, The Netherlands 1991: pp. 121–125.
Vajda, S. Fibonacci and Lucas Numbers, and the Golden Section. John Wiley and Sons, New York, 1989.
Walton, J. E. and Horadam, A. F. “Some Aspects of Generalized Fibonacci Numbers.” The Fibonacci Quarterly, Vol. 12 (1974): pp. 241–250.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Freitag, H.T., Phillips, G.M. (1993). Co-Related Sequences Satisfying the General Second Order Recurrence Relation. In: Bergum, G.E., Philippou, A.N., Horadam, A.F. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-2058-6_24
Download citation
DOI: https://doi.org/10.1007/978-94-011-2058-6_24
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4912-2
Online ISBN: 978-94-011-2058-6
eBook Packages: Springer Book Archive