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!)
A235934 Primes p with f(p), f(f(p)) and f(f(f(p))) all prime, where f(n) = prime(n) - n + 1. 4
2, 3, 23, 311, 1777, 2341, 2861, 3329, 3833, 4051, 8753, 9007, 11587, 13093, 13309, 14551, 16001, 19687, 23143, 26993, 37309, 41981, 44131, 45491, 54623, 56431, 56821, 57991, 60223, 61643, 66413, 66883, 67511, 68767, 69029, 70003, 75743, 76261, 76819, 80021 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
By the general conjecture in A235925, this sequence should have infinitely many terms.
LINKS
Z.-W. Sun, Problems on combinatorial properties of primes, arXiv:1402.6641, 2014
EXAMPLE
a(3) = 23 with 23, f(23) = 61, f(61) = 223 and f(223) = 1187 all prime.
MATHEMATICA
f[n_]:=Prime[n]-n+1
p[k_]:=PrimeQ[f[Prime[k]]]&&PrimeQ[f[f[Prime[k]]]]&&PrimeQ[f[f[f[Prime[k]]]]]
n=0; Do[If[p[k], n=n+1; Print[n, " ", Prime[k]]], {k, 1, 10000}]
CROSSREFS
Sequence in context: A139067 A099656 A157733 * A064888 A104458 A191859
KEYWORD
nonn
AUTHOR
Zhi-Wei Sun, Jan 17 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 May 13 20:33 EDT 2024. Contains 372522 sequences. (Running on oeis4.)