OFFSET
1,1
COMMENTS
The prime number theorem implies that, if q(n) = sum of first n primes, then a(n)/q(n) -> 3 as n -> oo. - N. J. A. Sloane, Oct 04 2007
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..1000
EXAMPLE
a(4)=60 because 11, 13, 17 and 19 follow the 4th prime, 7, and 11 + 13 + 17 + 19 = 60.
MAPLE
a:=proc(n) options operator, arrow; add(ithprime(j), j=n+1..2*n) end proc: seq(a(n), n=1..45); # Emeric Deutsch, Oct 20 2007
MATHEMATICA
Table[Sum[Prime[n + i], {i, 1, n}], {n, 1, 50}] (* Stefan Steinerberger, Oct 07 2007 *)
Table[Total[Prime[Range[n+1, 2n]]], {n, 50}] (* Harvey P. Dale, Apr 13 2018 *)
PROG
(PARI) a(n)=my(t=0); for(i=1, n, t=t+prime(n+i)); t \\ Anders Hellström, Sep 16 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
G. L. Honaker, Jr., Oct 03 2007
EXTENSIONS
More terms from Stefan Steinerberger, Oct 07 2007
More terms from Emeric Deutsch, Oct 20 2007
STATUS
approved