Abstract
In the paper [3], we have proved that the only triangular numbers (i.e., the positive integers of the form \( \frac{1}{2}m \)(m+1)) in the Fibonacci sequence
are u ±1=u2=1, u4=3, u8=21 and u10=55. This verifies a conjecture of Vern Hoggatt [2]. In this paper we shall find all triangular numbers in the Lucas sequence
where n ranges over all integers.
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
Cohn, J. H. E. “On Square Fibonacci Numbers.” J. London Math. Soc. 39 (1964): pp. 537–541.
Guy, R. K. Unsolved Problems in Number Theory. New York: Springer-Verlag, 1981, p. 106.
Luo, Ming. “On Triangular Fibonacci Numbers.” The Fibonacci Quarterly, 27.2 (1989): pp. 98–108.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Luo, M. (1991). On Triangular Lucas Numbers. 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-3586-3_26
Download citation
DOI: https://doi.org/10.1007/978-94-011-3586-3_26
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5590-1
Online ISBN: 978-94-011-3586-3
eBook Packages: Springer Book Archive