A Case Study in Meta-AUTOMATION: AUTOMATIC Generation of Congruence AUTOMATA For Combinatorial Sequences
arXiv:1311.4776 · doi:10.1080/10236198.2013.876422
Abstract
This article is a sequel to a recent article by Eric Rowland and Reem Yassawi, presenting yet another approach to the fast determination of congruence properties of `famous' combinatorial sequences. The present approach can be taught to a computer, and our beloved servant, Shalosh B. Ekhad, was able to generate many new theorems, for famous sequences, of course, but also for many obscure ones!
17 pages, accompanied by Maple packages