cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A123376 #9 Dec 10 2024 08:58:42
%S A123376 28,129,1371,7141,68341,163541,624211,1086557,2756043,8546951,
%T A123376 11791577,28122767,46308119,58262037,88870153,158512433,263952799,
%U A123376 308206649,480993245,635060975,724715753,1053143991,1331063769,1845563079,2750645663,3325653577,3650662901,4369224195,4767074983,5637335441
%N 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.
%e A123376 a(1)=28=2+3+5+7+11, since s(1)=5=2+3, since p(1)=2.
%p A123376 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;
%t A123376 With[{prs=Prime[Range[50000]]},Table[Total[Take[prs,Total[Take[prs, prs[[n]]]]]],{n,30}]] (* _Harvey P. Dale_, May 16 2012 *)
%Y A123376 Cf. A119411, A022094.
%K A123376 easy,nonn
%O A123376 1,1
%A A123376 Peter C. Heinig (algorithms(AT)gmx.de), Oct 13 2006
%E A123376 More terms from _Robert Israel_, Jul 30 2020