OFFSET
1,7
COMMENTS
Conjecture: a(n) > 0 for all n > 5.
This implies that there are infinitely many positive integers m with m + pi(m) prime.
LINKS
Zhi-Wei Sun, Table of n, a(n) for n = 1..2500
Z.-W. Sun, Problems on combinatorial properties of primes, arXiv:1402.6641, 2014
EXAMPLE
a(6) = 1 since 2*6 + pi(2*6) = 12 + 5 = 17 is prime.
a(47) = 1 since 21*47 + pi(21*47) = 987 + 166 = 1153 is prime.
MATHEMATICA
p[n_]:=PrimeQ[n+PrimePi[n]]
a[n_]:=Sum[If[p[k*n], 1, 0], {k, 1, n-1}]
Table[a[n], {n, 1, 100}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Zhi-Wei Sun, Feb 24 2014
STATUS
approved