OFFSET
1,5
COMMENTS
Conjecture: a(n) > 0 if n > 3 is not among 27, 34, 50, 61, 74, 78, 115, 120, 123, 127.
This implies that there are infinitely many primes in the range of the partition function p(n).
LINKS
Zhi-Wei Sun, Table of n, a(n) for n = 1..6500
Z.-W. Sun, Problems on combinatorial properties of primes, arXiv:1402.6641, 2014
EXAMPLE
a(26) = 1 since 26 = 2 + 24 with p(2 + phi(24)/2) = p(6) = 11 prime.
a(54) = 1 since 54 = 27 + 27 with p(27 + phi(27)/2) = p(36) = 17977 prime.
a(73) = 1 since 73 = 1 + 72 with p(1 + phi(72)/2) = p(36) = 17977 prime.
a(110) = 1 since 110 = 65 + 45 with p(65 + phi(45)/2) = p(77) = 10619863 prime.
a(150) = 1 since 150 = 123 + 27 with p(123 + phi(27)/2) = p(132) = 6620830889 prime.
a(170) = 1 since 170 = 167 + 3 with p(167 + phi(3)/2) = p(168) = 228204732751 prime.
MATHEMATICA
f[n_, k_]:=PartitionsP[k+EulerPhi[n-k]/2]
a[n_]:=Sum[If[PrimeQ[f[n, k]], 1, 0], {k, 1, n-3}]
Table[a[n], {n, 1, 100}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Zhi-Wei Sun, Dec 26 2013
STATUS
approved