login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082251 Primes that are the sum of 9 consecutive primes. 16
127, 401, 439, 479, 593, 881, 929, 977, 1163, 1213, 1321, 1367, 1459, 1511, 1601, 1747, 1801, 1951, 1999, 2053, 2111, 2393, 2713, 3299, 3457, 3517, 3571, 3739, 3793, 4091, 4253, 4621, 4691, 4969, 5413, 5521, 5827, 5987, 6173, 6379, 6947, 7151, 7741 (list; graph; refs; listen; history; text; internal format)
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

Sequence in context: A143034 A159521 A122691 * A142384 A298237 A299363

Adjacent sequences:  A082248 A082249 A082250 * A082252 A082253 A082254

KEYWORD

easy,nonn

AUTHOR

Cino Hilliard, May 09 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 17 02:29 EST 2018. Contains 318192 sequences. (Running on oeis4.)