Structure and asymptotics for Motzkin numbers modulo small primes using automata

Abstract

We establish the asymptotic density and some structure results for the Motzkin numbers modulo primes up to 29 using automata.

arXiv comment20 page, 9 figures

References in corpus (2)

• A method for determining the mod-$p^k$ behaviour of recursive sequences
• Asymptotic density of Motzkin numbers modulo small primes

Cited by in corpus (1)

• Structure and asymptotics for Catalan numbers modulo primes using automata