Equality of Shifted Partition Functions

Abstract

Recently George Andrews [2] asked for sets of integers S and T, so that P(S, n) = P(T, n ”1) for all n ≥ 1, where P(S, n), is the number of partitions into elements of S. We quote some of his results here.

If -S' = { n | n odd or n is ± 4 , ± 6 , ± 8 , ± 10 (mod32)}