login
A238459
Number of primes p < n with q(n-p) + 1 prime, where q(.) is the strict partition function (A000009).
3
0, 0, 1, 2, 2, 3, 2, 3, 3, 2, 3, 2, 5, 3, 5, 4, 4, 3, 4, 4, 6, 2, 4, 3, 5, 2, 4, 1, 4, 5, 6, 5, 5, 4, 5, 3, 4, 3, 5, 6, 5, 6, 3, 8, 6, 5, 6, 4, 6, 7, 5, 6, 4, 6, 7, 6, 7, 7, 6, 6, 7, 5, 6, 5, 6, 5, 5, 5, 7, 7, 6, 5, 7, 9, 8, 6, 5, 5, 7, 6, 8, 6, 5, 8, 7, 8, 7, 4, 8, 7, 7, 7, 6, 6, 6, 6, 6, 7, 6, 9
OFFSET
1,4
COMMENTS
Conjecture: a(n) > 0 for all n > 2. Also, for each n > 6 there is a prime p < n with q(n-p) - 1 prime.
We have verified the conjecture for n up to 10^5.
See also A238458 for a similar conjecture involving the partition function p(n).
LINKS
Zhi-Wei Sun, Problems on combinatorial properties of primes, arXiv:1402.6641, 2014.
EXAMPLE
a(3) = 1 since 2 and q(3-2) + 1 = 1 + 1 = 2 are both prime.
a(28) = 1 since 17 and q(28-17) + 1 = q(11) + 1 = 12 + 1 = 13 are both prime.
MATHEMATICA
q[n_, k_]:=PrimeQ[PartitionsQ[n-Prime[k]]+1]
a[n_]:=Sum[If[q[n, k], 1, 0], {k, 1, PrimePi[n-1]}]
Table[a[n], {n, 1, 100}]
KEYWORD
nonn
AUTHOR
Zhi-Wei Sun, Feb 27 2014
STATUS
approved