OFFSET
1,1
COMMENTS
By the conjecture in A234694, this sequence should have infinitely many terms.
LINKS
Zhi-Wei Sun, Table of n, a(n) for n = 1..10000
Z.-W. Sun, Problems on combinatorial properties of primes, arXiv:1402.6641, 2014
FORMULA
a(n) = prime(A234852(n)). - M. F. Hasler, Dec 31 2013
EXAMPLE
a(1) = 2 since prime(2) - 1 = 2 is prime.
a(2) = 3 since prime(3) - 2 = 3 is prime.
a(3) = 5 since prime(5) - 4 = 7 is prime.
a(4) = 7 since prime(7) - 6 = 11 is prime.
MATHEMATICA
n=0; Do[If[PrimeQ[Prime[Prime[k]]-Prime[k]+1], n=n+1; Print[n, " ", Prime[k]]], {k, 1, 1000}]
PROG
(PARI) forprime(p=1, 999, isprime(prime(p)-p+1)&&print1(p", ")) \\ - M. F. Hasler, Dec 31 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
Zhi-Wei Sun, Dec 29 2013
STATUS
approved