Motzkin numbers and related sequences modulo powers of 2

From MaRDI portal
Publication:1663803

DOI10.1016/J.EJC.2018.05.004zbMATH Open1398.11046arXiv1608.05657OpenAlexW2962940499MaRDI QIDQ1663803FDOQ1663803

T. W. Müller, C. Krattenthaler

Publication date: 24 August 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: We show that the generating function sumnge0Mn,zn for Motzkin numbers Mn, when coefficients are reduced modulo a given power of 2, can be expressed as a polynomial in the basic series sumege0z4e/(1z2cdot4e) with coefficients being Laurent polynomials in z and 1z. We use this result to determine Mn modulo 8 in terms of the binary digits of~n, thus improving, respectively complementing earlier results by Eu, Liu and Yeh [Europ. J. Combin. 29 (2008), 1449-1466] and by Rowland and Yassawi [J. Th'eorie Nombres Bordeaux 27 (2015), 245-288]. Analogous results are also shown to hold for related combinatorial sequences, namely for the Motzkin prefix numbers, Riordan numbers, central trinomial coefficients, and for the sequence of hex tree numbers.


Full work available at URL: https://arxiv.org/abs/1608.05657





Cites Work


Cited In (2)






This page was built for publication: Motzkin numbers and related sequences modulo powers of 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663803)