login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024011 Numbers n such that n-th prime divides sum of first n primes. 10
1, 3, 20, 31464, 22096548 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

No other terms below pi(10^12) = 37607912018. - Jon E. Schoenfield, Sep 11 2008

No other terms below pi(10^14) = 3204941750802. - Giovanni Resta, Jan 09 2014

LINKS

Table of n, a(n) for n=1..5.

EXAMPLE

The third prime, 5, divides 2 + 3 + 5 = 10, so 3 is in the sequence.

2 + 3 + 5 + 7 = 17, which is not divisible by the fourth prime, 7, so 4 is not in the sequence.

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]]]

With[{prs = Prime[Range[221000000]]}, PrimePi /@ Transpose[Select[Thread[{Accumulate[prs], prs}], Divisible[#[[1]], #[[2]]] &]][[2]]] (* Harvey P. Dale, Jul 23 2013 *)

nMax = 50000; primeSums = Accumulate[Prime[Range[nMax]]]; Select[Range[nMax], Divisible[primeSums[[#]], Prime[#]] &] (* Alonso del Arte, Nov 11 2019 *)

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 * A229197 A188721 A212996

Adjacent sequences:  A024008 A024009 A024010 * A024012 A024013 A024014

KEYWORD

nonn,nice,hard,more

AUTHOR

G. L. Honaker, Jr.

EXTENSIONS

a(5) from Kok Seng Chua (chuaks(AT)ihpc.nus.edu.sg), May 14 2000

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 May 15 20:08 EDT 2021. Contains 343920 sequences. (Running on oeis4.)