Abstract
Like the Fibonacci family [126], the Pell family has delightful applications to combinatorics. This chapter presents several such applications. In the process, we will revisit Fibonacci numbers, and encounter a new family that arises in combinatorics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
L. Comtet, Advanced Combinatorics, D. Reidel, Boston, MA, 1974.
T. Koshy, Fibonacci and Lucas Numbers with Applications, Wiley, New York, 2001.
A. Nkwanta and L.W. Shapiro, Pell Walks and Riordan Matrices, Fibonacci Quarterly 43 (2005), 170–180.
R.P. Stanley, Enumerative Combinatorics, Vol. 1, Cambridge University Press, New York, 1997.
R.P. Stanley, Enumerative Combinatorics, Vol. 2, Cambridge University Press, New York, 1999.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this chapter
Cite this chapter
Koshy, T. (2014). Pell Walks. In: Pell and Pell–Lucas Numbers with Applications. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8489-9_12
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8489-9_12
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8488-2
Online ISBN: 978-1-4614-8489-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)