OFFSET
1,1
LINKS
http://h.xerol.org/f/1primecheck.txtShows applicable sequences of primes for n = 2..9
EXAMPLE
For n = 2, k = 2*3 = 6. The first prime at least 3 greater than 6 is 11.
11-6 = 5, 13-6 = 7, 17-6 = 11, 19-6 = 13, 23-6 = 17, 29-6 = 23, all of which are primes. 31-6 = 25 is not prime, so a(2) = 6 because there are 6 prime terms.
MAPLE
with(numtheory): a:=proc(n) local k, p, c, ct, j: k:=product(ithprime(i), i=1..n); p:=nextprime(k+2); c:=pi(p): ct:=0: for j from c while isprime(ithprime(j)-k)=true do ct:=ct+1: od: ct; end: seq(a(n), n=1..9); # Emeric Deutsch, Apr 13 2007
CROSSREFS
KEYWORD
nonn
AUTHOR
Ellis M. Eisen (xerol(AT)xerol.org), Apr 02 2007
EXTENSIONS
Corrected by Emeric Deutsch, Apr 13 2007
More terms from R. J. Mathar, Sep 23 2007
STATUS
approved