×

Combinatorial interpretation of generalized Pell numbers. (English) Zbl 1447.11023

Summary: In this note we give combinatorial interpretations for the generalized Pell sequence of order \(k\) by means of lattice paths and generalized bi-colored compositions. We also derive some basic relations and identities by using Riordan arrays.

MSC:

11B39 Fibonacci and Lucas numbers and polynomials and generalizations
05A19 Combinatorial identities, bijective combinatorics

Software:

OEIS

References:

[1] A. Benjamin and J. Quinn,Proofs that Really Count: The Art of Combinatorial Proof, Dolciani Mathematical Expositions27, Mathematical Association of America, 2003. · Zbl 1044.11001
[2] R. P. Brent, On the periods of generalized Fibonacci recurrences,Math. Comp.63 (1994), 389-401. · Zbl 0809.11083
[3] C. Cooper and F. T. Howard, Some identities forr-Fibonacci numbers,Fibonacci Quart. 49(2011), 231-243. · Zbl 1264.11008
[4] ´E. Czabarka, R. Fl´orez, L. Junes, and J. L. Ram´ırez, Enumerations of peaks and valleys on non-decreasing Dyck paths,Discrete Math.341(2018), 2789-2807. · Zbl 1393.05154
[5] G. P. Dresden and Z. Du, A simplified Binet formula fork-generalized Fibonacci numbers,J. Integer Sequences17(2014),Article 14.4.7. · Zbl 1360.11031
[6] R. Fl´orez, L. Junes, and J. L. Ram´ırez, Further results on paths in ann-dimensional cubic lattice,J. Integer Sequences21(2018),Article 18.1.2. · Zbl 1384.05022
[7] C. Heberle,A combinatorial approach tor-Fibonacci numbers. HMC Senior Thesis, Harvey Mudd College, 2012.
[8] E. Kili¸c, The Binet formula, sums and representations of generalized Fibonacci p−numbers,European J. Combin.29(2008), 701-711. · Zbl 1138.11004
[9] E. Kili¸c, On the usual Fibonacci and generalized order-kPell number,Ars. Comb.109 (2013), 391-403. · Zbl 1289.11013
[10] T. Koshy,Fibonacci and Lucas Number with Applications, A Wiley-Interscience Publications, 2001. · Zbl 0984.11010
[11] T. Koshy,Pell and Pell-Lucas Numbers with Applications, Springer-Verlag, 2014. · Zbl 1330.11002
[12] D. Merlini and M. Nocentini, Patterns in Riordan arrays, inSecond International Symposium on Riordan Arrays and Related Topics, Lecco, Italy, 2015, pp. 22.
[13] D. Merlini, D. G. Rogers, R. Sprugnoli, and M. C. Verri, Underdiagonal lattice paths with unrestricted steps,Discrete Appl. Math.91(1999) 197-213. · Zbl 0923.05003
[14] J. B. Muskat, Generalized Fibonacci and Lucas sequences and rootfinding methods, Math. Comp.61(1993), 365-372. · Zbl 0781.11006
[15] J. L. Ram´ırez and V. F. Sirvent, A generalization of thek-bonacci sequence from Riordan arrays,Electron. J. Combin.22(2015) Paper #P1.38. · Zbl 1308.11016
[16] J. L. Ram´ırez and V. F. Sirvent, Generalized Schr¨oder matrix and its combinatorial interpretation,Linear Multilinear Algebra66.2(2018) 418-433. · Zbl 1387.15004
[17] J. L. Ram´ırez and V. F. Sirvent, Aq-analogue of the biperiodic Fibonacci sequence,J. Integer Sequences19(2016),Article 16.4.6. · Zbl 1415.11033
[18] L. W. Shapiro, S. Getu, W. Woan, and L. Woodson, The Riordan group,Discrete Appl. Math.34(1991) 229-239. · Zbl 0754.05010
[19] R. Sprugnoli, Riordan arrays and combinatorial sums,Discrete Math.132(1994) 267- 290. · Zbl 0814.05003
[20] S.-L. Yang, Y.-N. Dong, and T.-X. He, Some matrix identities on colored Motzkin paths, Discrete Math.340(2017) 3081-3091. · Zbl 1370.05114
[21] S.-L. Yang, Y.-N. Dong, T.-X. He, and Y.-X. Xu, A unified approach for the Catalan matrices by using Riordan arrays,Linear Algebra Appl.558(2018), 25-43. · Zbl 1397.05017
[22] S.-L. Yang, Y.-N. Dong, L. Yang, and J. Yin, Half of a Riordan array and restricted lattice paths,Linear Algebra Appl.537(2018) 1-11. · Zbl 1373.05007
[23] S. · Zbl 1443.11023
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.