Congruence properties of functions related to the partition function (Q1314968)

For the integer \(k\) define \(p_ k(n)\) by \(\prod_{m=1}^ \infty (1- x^ m)^ k= \sum_{n=0}^ \infty p_ k(n) x^ n\). It will be noted that \(p_{-1}(n)\) is the partition function, \(p(n)\). \textit{S. Ramanujan} has proved [Proc. Camb. Philos. Soc. 19, 207-210 (1919; JFM 47.0885.01); Math. Z. 9, 147-153 (1921; JFM 48.0150.02)] that \(p(5n+4)\equiv 0\pmod 5\), \(p(7n+5)\equiv 0\pmod 7\), and \(p(11n+6)\equiv 0\pmod{11}\) for all \(n\geq 1\). A ``straightforward and almost entirely elementary method'' is now described for establishing congruences of the form \(p_ k(np+b) \equiv 0\pmod p\), and a table is given showing when this congruence is satisfied for thirty-four primes \(p\) ranging from \(p=11\) to \(p=199\) and, for each \(p\), for one or more values of \(k\) reduced modulo \(p\).