[
[1] A. Bacher, Generalized Dyck paths of bounded height, arXiv:1303.2724.
]Search in Google Scholar
[
[2] E. Barcucci, A. Bernini and R. Pinzani, Strings from linear recurrences: a Gray code, in: Lecroq, T. and Puzynina, S. (Eds.), Combinatorics on Words, 13th International Conference, WORDS 2021, Lecture Notes in Comput. Sci., 12847 (2021) 40–49.
]Search in Google Scholar
[
[3] E. Barcucci, A. Bernini and M. Poneti, From Fibonacci to Catalan permutations, Pure Math. Appl. (PU.M.A), 17 (2006) 1–17.
]Search in Google Scholar
[
[4] M. Bousquet-Mélou, Discrete excursions, Sém. Lothar. Combin., 57 (2008) B57d.10.1016/j.endm.2008.06.016
]Search in Google Scholar
[
[5] J. J. Bravo, J. L. Herrera and J. L. Ramírez, Combinatorial interpretation of generalized Pell numbers, J. Integer Seq. 23 (2020) 20.2.1.
]Search in Google Scholar
[
[6] D. E. Knuth, The Art of Computer Programming: Sorting and Searching, Vol. 3, 1966, Addison-Wesley.
]Search in Google Scholar
[
[7] N. J. A. Sloane and The OEIS Foundation Inc., The on-line encyclopedia of integer sequences, http://oeis.org.
]Search in Google Scholar
[
[8] V. Vajnovszki, A loopless generation of bitstrings without p consecutive ones, in: Calude, C. S., Dinneen, M. J. and Sburlan, S. (Eds.), Combinatorics, Computability and Logic (2001), Discrete Mathematics and Theoretical Computer Science, Springer, London, pp. 227–240.
]Search in Google Scholar
