Craig–van Ittersum–Ono conjecture on prime-detecting linear combinations of MacMahon’s M_a(n)
Determine whether, for each integer n, every n-linear combination of the MacMahon weighted partition numbers M_a(n) that detects primes (i.e., vanishes at n if and only if n is prime) is precisely an n-linear combination of the specific quasimodular forms listed in Craig–van Ittersum–Ono’s Table 1; equivalently, establish that an n-linear combination of the sequence M_a(n) is an n-linear combination of the quasimodular Eisenstein forms H_k (with k ≥ 6) if and only if it is an n-linear combination of the Table 1 forms of Craig–van Ittersum–Ono.
References
In the introduction of , they conjecture that $(n)$-linear combinations of the $M_a(n)$s detect primes if and only if they are $(n)$-linear combinations of the forms in Table 1. Given the classification of prime-detecting quasimodular forms in Corollary \ref{cor:PrimeDetecting}, their conjecture is equivalent to showing that a $(n)$-linear combination of the $M_a(n)$ is a $(n)$-linear combination of the forms $H_k$ with $k\geqslant 6$ if and only if it is a $(n)$-linear combination of the forms in Table 1.