%I A007504 M1370
%S A007504 2,5,10,17,28,41,58,77,100,129,160,197,238,281,328,381,440,501,568,639,
%T A007504 712,791,874,963,1060,1161,1264,1371,1480,1593,1720,1851,1988,2127,2276,
%U A007504 2427,2584,2747,2914,3087,3266,3447,3638,3831,4028,4227,4438,4661,4888
%N A007504 Sum of first n primes.
%D A007504 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A007504 H. L. Nelson, "Prime Sums", J. Rec. Math., 14 (1981), 205-206.
%H A007504 R. J. Mathar, <a href="b007504.txt">Table of n, a(n) for n = 1..100000</
               a>
%H A007504 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               PrimeSums.html">Link to a section of The World of Mathematics.</a>
%F A007504 a(n) has the asymptotic expression a(n) ~ n^2 * log(n) / 2. - Ahmed Fares 
               (ahmedfares(AT)my-deja.com), Apr 24 2001
%F A007504 a(n) = A014284(n+1) - 1. [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), 
               Aug 19 2009]
%F A007504 a(n+1) - a(n) = A000040(n+1) = (n+1)-th primes. [From Jaroslav Krizek 
               (jaroslav.krizek(AT)atlas.cz), Aug 19 2009]
%p A007504 s1:=[2]; for n from 2 to 1000 do s1:=[op(s1),s1[n-1]+ithprime(n)]; od: 
               s1;
%t A007504 Table[Sum[Prime[i], {i, 1, n}], {n, 1, 100}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), 
               Apr 11 2006
%Y A007504 Cf. A000041, A034386, A111287. See A122989 for the value of Sum_{ n >
               = 1} 1/a(n).
%Y A007504 Sequence in context: A119114 A062493 A056871 this_sequence A049688 A011894 
               A071602
%Y A007504 Adjacent sequences: A007501 A007502 A007503 this_sequence A007505 A007506 
               A007507
%K A007504 nonn,nice,easy
%O A007504 1,1
%A A007504 N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com)
%E A007504 More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), 
               Apr 11 2006