MacMahonesque partition functions detect sets related to primes

Abstract

Recent work by Craig, van Ittersum, and Ono constructs explicit expressions in the partition functions of MacMahon that detect the prime numbers. Furthermore, they define generalizations, the MacMahonesque functions, and prove there are infinitely many such expressions in these functions. Here, we show how to modify and adapt their construction to detect cubes of primes as well as primes in arithmetic progressions.