arXiv · 1703.00826
Structure and asymptotics for Motzkin numbers modulo primes using automata
Abstract
We establish a lower bound of 2/p(p-1) for the asymptotic density of the Motzkin numbers divisible by a general prime number p > 3. We provide a criteria for when this asymptotic density is actually 1. We also provide a partial characterisation of those Motzkin numbers which are divisible by a prime p > 3. All results are obtained using the automata method of Rowland and Yassawi.
Explore related subjects
Keep this discovery
Rob Burns. 2017-03-02. Structure and asymptotics for Motzkin numbers modulo primes using automata. https://arxiv.org/abs/1703.00826
Cite the original work for its findings. Save a collection to share your selection of sources.