OFFSET
1,1
COMMENTS
Prime(a(n)) = 3, 5, 11, 101, 191, 821, 1481, 1871, 2081, ...; starting with 11 on, all primes == 11 (mod 30). - Zak Seidov, Jan 25 2013
LINKS
Zak Seidov, Table of n, a(n) for n = 1..10000 (first 1000 terms from Harry J. Smith)
MATHEMATICA
t={}; Do[If[Prime[n + 3] == Prime[n] + 8, AppendTo[t, n]], {n, 1000}]; t (* Zak Seidov, Jan 25 2013 *)
PROG
(PARI) d(n) = prime(n+1)-prime(n); e(n) = d(n)+d(n+1)+d(n+2); j=[]; for(n=1, 35000, if(e(n)==8, j=concat(j, n))); j
(PARI) d3(n)= { prime(n + 3) - prime(n) } { n=0; default(primelimit, 12000000); for (m=1, 10^9, if (d3(m)==8, write("b064026.txt", n++, " ", m); if (n==1000, break)) ) } \\ Harry J. Smith, Sep 06 2009
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jason Earls, Sep 08 2001
STATUS
approved