OFFSET
1,1
COMMENTS
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..1000
MAPLE
isA007530 := proc(n) local q; if isprime(n) and n>=5 then q := nextprime(n) ; if q-n = 2 then q := nextprime(q) ; if q -n = 6 then q := nextprime(q) ; RETURN( q-n = 8 ) ; else RETURN(false) ; fi ; else RETURN(false) ; ; fi ; else RETURN(false) ; ; fi ; end: A007530 := proc(n) option remember ; local a; if n = 1 then 5 ; else a := nextprime(A007530(n-1)) ; while not isA007530(a) do a := nextprime(a) ; od: RETURN(a) ; fi ; end: A138637 := proc(n) local p ; p := A007530(n) ; p*(p+2)*(p+6)*(p+8) ; end: seq(A138637(n), n=1..20) ; # R. J. Mathar, May 18 2008
MATHEMATICA
a = {}; For[n = 1, n < 5000, n++, If[{Prime[n+1]-Prime[n], Prime[n+2]-Prime[n+1], Prime[n+3]-Prime[n+2]} == {2, 4, 2}, AppendTo[a, Prime[n]*Prime[n+1]*Prime[n+2]* Prime[n+3]]]]; a (* Stefan Steinerberger, May 18 2008 *)
Times@@@Select[Partition[Prime[Range[2500]], 4, 1], Differences[#]=={2, 4, 2}&] (* Harvey P. Dale, Sep 10 2018 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, May 14 2008
EXTENSIONS
More terms from Stefan Steinerberger and R. J. Mathar, May 18 2008
STATUS
approved