These files contain minimal finite automata that compute the *n*th Motzkin number modulo various prime powers.
In particular, they show that no Motzkin number is divisible by 2^{3}, 5^{2}, 13^{2}, 31^{2}, or 37^{2}.
They were computed with my package IntegerSequences.
See my paper with Reem Yassawi for more details.

- modulo 2
^{3}(24 states) and modulo 2^{6}(701 states) - modulo 3
^{5}(3866 states) - modulo 5
^{2}(136 states) and modulo 5^{3}(2797 states) - modulo 7
^{2}(317 states) and modulo 7^{3}(12300 states) - modulo 13
^{2}(2097 states) - modulo 31
^{2}(28081 states) - modulo 37
^{2}(44173 states)

These automata can be also computed by another method, described in my paper with Doron Zeilberger and implemented in his package AutoSquared.