OFFSET
1,1
COMMENTS
Conjecture: For any positive integer m, there are infinitely many chains p(1) < p(2) < ... < p(m) of m primes with p(k) + 2 prime for all k = 1,...,m such that p(k + 1) = prime(p(k)) for every 0 < k < m.
LINKS
Zhi-Wei Sun, Table of n, a(n) for n = 1..5000
Zhi-Wei Sun, A new kind of prime chains, a message to Number Theory List, Jan. 20, 2014.
EXAMPLE
a(1) = 3 since 3, 3 + 2 = 5, prime(3) + 2 = 7 and prime(prime(3)) + 2 = prime(5) + 2 = 13 are all prime, but 2 + 2 = 4 is composite.
MATHEMATICA
p[n_]:=p[n]=PrimeQ[n+2]&&PrimeQ[Prime[n]+2]&&PrimeQ[Prime[Prime[n]]+2]
n=0; Do[If[p[Prime[m]], n=n+1; Print[n, " ", Prime[m]]], {m, 1, 10^6}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Zhi-Wei Sun, Jan 26 2014
STATUS
approved