OFFSET
0,1
COMMENTS
Increasing primes p such that p + 2n is prime.
LINKS
T. D. Noe, Table of n, a(n) for n = 0..10000
EXAMPLE
a(0)=2 since 2+0=2 is prime; a(1)=3 since 3+2=5 is prime.
a(2)=7 since 7+4=11 is prime; 5 is not in the sequence since 5+4=9 is not prime.
MAPLE
A108184 := proc(n) option remember; if n = 1 then 3; else for a from procname(n-1)+1 do if isprime(a) and isprime(a+2*n) then RETURN(a) ; fi; od: fi; end: seq(A108184(n), n=1..100) ; # R. J. Mathar, Jan 31 2009
MATHEMATICA
t = {2}; Do[p = NextPrime[t[[-1]]]; While[! PrimeQ[p + 2 n], p = NextPrime[p]]; AppendTo[t, p], {n, 100}]; t (* T. D. Noe, Feb 04 2014 *)
PROG
(PARI) A108184(maxp) = {my(a=[2], n=1); forprime(p=3, maxp, if(isprime(p+2*n), n++; a=concat(a, p))); a} \\ Colin Barker, Feb 03 2014
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Giovanni Teofilatto, Jun 28 2005
EXTENSIONS
Edited and extended by Ray Chandler, Jul 07 2005
Edited by N. J. A. Sloane, Feb 11 2009 at the suggestion of R. J. Mathar
STATUS
approved