Uniform recurrence in the Motzkin numbers and related sequences mod \(p\)
The electronic journal of combinatorics, Tome 32 (2025) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Many famous integer sequences, including the Catalan numbers and the Motzkin numbers, can be expressed as the constant terms of the polynomials $P(x)^nQ(x)$ for some Laurent polynomial $Q$, and symmetric Laurent trinomial $P$. In this paper, we characterize the primes for which sequences of this form are uniformly recurrent modulo $p$. For all other primes, we show that the set of indices for which our sequences are congruent to $0$ has density $1$. This is accomplished by showing that the study of these sequences mod $p$ can be reduced to the study of the generalized central trinomial coefficients, which are well-behaved mod $p$.
DOI : 10.37236/13089
Classification : 11B50, 68R15, 05A15, 11B85

Nadav Kohen  1

1 Indiana University
@article{10_37236_13089,
     author = {Nadav Kohen},
     title = {Uniform recurrence in the {Motzkin} numbers and related sequences mod \(p\)},
     journal = {The electronic journal of combinatorics},
     year = {2025},
     volume = {32},
     number = {2},
     doi = {10.37236/13089},
     zbl = {8062178},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/13089/}
}
TY  - JOUR
AU  - Nadav Kohen
TI  - Uniform recurrence in the Motzkin numbers and related sequences mod \(p\)
JO  - The electronic journal of combinatorics
PY  - 2025
VL  - 32
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/13089/
DO  - 10.37236/13089
ID  - 10_37236_13089
ER  - 
%0 Journal Article
%A Nadav Kohen
%T Uniform recurrence in the Motzkin numbers and related sequences mod \(p\)
%J The electronic journal of combinatorics
%D 2025
%V 32
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/13089/
%R 10.37236/13089
%F 10_37236_13089
Nadav Kohen. Uniform recurrence in the Motzkin numbers and related sequences mod \(p\). The electronic journal of combinatorics, Tome 32 (2025) no. 2. doi: 10.37236/13089

Cité par Sources :