Abstract
Like Fibonacci and Lucas numbers, Pell and Pell-Lucas numbers are a fertile ground for creativity and exploration. They also have interesting applications to combinatorics [1], especially to the study of lattice paths [2, 3], as we will see shortly.Pell numbers Pn and Pell-Lucas numbers Qn are often defined recursively [4, 5]:where n ≥ 3. They can also be defined by Binet-like formulas:
Publisher
Cambridge University Press (CUP)
Reference7 articles.
1. Advanced Combinatorics
2. Counting on Chebyshev Polynomials
3. Pell numbers: A Fibonacci-like treasure for creative exploration;Koshy;Mathematics Teacher,2011
4. Objects counted by the central Delannoy numbers;Sulanke;Journal of Integer Sequences,2003
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. References;Fibonacci and Lucas Numbers With Applications;2019-01-11
2. Feedback;The Mathematical Gazette;2013-11