Abstract. In this paper we use the framework of automatic sequences to study combinatorial sequences modulo prime powers. Given a sequence whose generating function is the diagonal of a rational power ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results