OFFSET
1,1
LINKS
Syed Iddi Hasan, Table of n, a(n) for n = 1..10000
MATHEMATICA
Clear[Sum9Primes]; Sum9Primes[a_]:=Module[{p}, p=Prime[a]+Prime[a+1] +Prime[a+2]+Prime[a+3]+Prime[a+4]+Prime[a+5] +Prime[a+6] +Prime[a+7]+Prime[a+8]]; lst={}; Do[If[PrimeQ[p=Sum9Primes[n]], AppendTo[lst, p]], {n, 6!}]; lst (* Vladimir Joseph Stephan Orlovsky, Apr 06 2009 *)
PROG
(PARI) \\ primes in the sum of m odd number of consecutive primes. m=9
psumprm(m, n) = { sr=0; s=0; for(j=1, m, s+=prime(j); ); for(x=1, n, s = s - prime(x)+ prime(x+m); if(isprime(s), sr+=1.0/s; print1(s" ")); ); print(); print(sr) }
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Cino Hilliard, May 09 2003
STATUS
approved