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!)
A235984 Primes p with f(p), f(f(p)), f(f(f(p))), f(f(f(f(p)))), f(f(f(f(f(p))))) all prime, where f(n) = prime(n) - n + 1. 2
2, 3, 501187, 560029, 2076881, 2836003, 2907011, 8254787, 8822347, 10322189, 11329181, 11354641, 12307693, 14528069, 15801601, 17757427, 19023091, 24995669, 25871971 (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) = 501187 with 501187, f(501187) = 6886357, f(6886357) = 113948711, f(113948711) = 2224096873, f(2224096873) = 50351471977 and f(50351471977) = 1303792228393 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]]]]]&&PrimeQ[f[f[f[f[Prime[k]]]]]]&&PrimeQ[f[f[f[f[f[Prime[k]]]]]]]
n=0; Do[If[p[k], n=n+1; Print[n, " ", Prime[k]]], {k, 1, 10^7}]
CROSSREFS
Sequence in context: A324154 A038537 A338404 * A120313 A216981 A307255
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 September 16 23:59 EDT 2024. Contains 375984 sequences. (Running on oeis4.)