Fast computation of Andrews’ smallest part statistic and conjectured congruences

Let spt(n) denote Andrews’ smallest part statistic. Andrews discovered congruences for spt(n) mod 5,75,7 and 13 which are reminiscent of Ramanujan’s classical partition congruences for moduli 5, 7, and 11. We create an algorithm exploiting a recursive pattern in Andrews’ smallest part statistic, spt(n), to generate modular residues of spt values in quadratic time and linear working memory. We use this algorithm to acquire the first million values of spt(n). On the basis of the data, we make conjectures about the existence of hundreds of thousands of new congruences including a simple modulus 11 congruence that was found and proved independently by Garvan.