The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A237712 a(n) = |{0 < k < n: k*n + pi(k*n) is prime}|, where pi(.) is given by A000720. 3
0, 1, 1, 1, 0, 1, 3, 1, 3, 1, 2, 3, 4, 3, 3, 2, 2, 4, 4, 1, 5, 2, 2, 4, 2, 6, 8, 5, 6, 3, 4, 5, 2, 4, 3, 3, 8, 5, 8, 6, 4, 3, 10, 6, 6, 5, 1, 7, 4, 4, 6, 9, 6, 9, 5, 4, 6, 10, 3, 7, 7, 6, 3, 8, 13, 5, 8, 3, 9, 11, 4, 8, 6, 8, 11, 11, 11, 12, 13, 12, 10, 6, 7, 7, 4, 16, 10, 8, 9, 4, 6, 14, 11, 7, 4, 13, 10, 13, 8, 10 (list; graph; refs; listen; history; text; internal format)
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
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
Sequence in context: A353415 A078929 A030728 * A227920 A138291 A201681
KEYWORD
nonn
AUTHOR
Zhi-Wei Sun, Feb 24 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 6 09:03 EDT 2024. Contains 373119 sequences. (Running on oeis4.)