|
| |
|
|
A024011
|
|
Numbers n such that n-th prime divides sum of first n primes.
|
|
5
| | |
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| No other terms below pi(10^12)=37607912018. [From Jon E. Schoenfield (jonscho(AT)hiwaay.net), Sep 11 2008]
|
|
|
EXAMPLE
| The third prime, 5, divides 2+3+5 = 10.
|
|
|
MATHEMATICA
| s = 0; For[i = 1, i <= 5*10^7, i++, s = s + Prime[i]; If[Mod[s, Prime[i + 1]] == 0, Print[i + 1]]]
|
|
|
PROG
| (PARI) s=0; t=0; for(w=2, 1000000000, if(isprime(w), s=s+w; t=t+1; if(s%w, print(t)), ))
|
|
|
CROSSREFS
| Cf. A007506, A028581, A028582, A071089.
Sequence in context: A002857 A203314 A174652 * A052445 A188721 A089999
Adjacent sequences: A024008 A024009 A024010 * A024012 A024013 A024014
|
|
|
KEYWORD
| nonn,nice,hard,more
|
|
|
AUTHOR
| G. L. Honaker, Jr. (honak3r(AT)gmail.com)
|
|
|
EXTENSIONS
| 5th term from Kok Seng Chua (chuaks(AT)ihpc.nus.edu.sg), May 14 2000
|
| |
|
|
