A123376 Sum of the first s(n) primes, where s(n) is the sum of the first p(n) primes, where p(n) is the n-th prime. Note that s(n) is A022094.

28, 129, 1371, 7141, 68341, 163541, 624211, 1086557, 2756043, 8546951, 11791577, 28122767, 46308119, 58262037, 88870153, 158512433, 263952799, 308206649, 480993245, 635060975, 724715753, 1053143991, 1331063769, 1845563079, 2750645663, 3325653577, 3650662901, 4369224195, 4767074983, 5637335441

Offset: 1

Author

Peter C. Heinig (algorithms(AT)gmx.de), Oct 13 2006

Keywords

• easy
• nonn

Examples

			a(1)=28=2+3+5+7+11, since s(1)=5=2+3, since p(1)=2.
		

Crossrefs

Cf. A119411, A022094.

Programs

Maple

for j from 1 to 23 do s[j]:=sum(ithprime(i), i=1..ithprime(j)); od; for j from 1 to 23 do sum(ithprime(i), i=1..s[j]); od;

Mathematica

With[{prs=Prime[Range[50000]]},Table[Total[Take[prs,Total[Take[prs, prs[[n]]]]]],{n,30}]] (* Harvey P. Dale, May 16 2012 *)

Extensions

More terms from Robert Israel, Jul 30 2020