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.
%I A113633 #26 Jul 01 2024 02:33:35
%S A113633 2,28,1060,39612,1336090,42157238,1271530648,37178373556,
%T A113633 1062895088910,29878892909030,828999068943506,22762324818835316,
%U A113633 619715756464336328,16753554900339748756,450233110894196298638,12038074430656287496566,320451759639384414082274,8497567719126134980044214
%N A113633 Sum of the first 5^n primes.
%C A113633 Using the program at the link, computation of the next term, a(15), would require generating a list of the first 31 * 10^9 8-byte primes (file size: 250 GB). Given runtimes of 0.06, 0.13, 0.63, 7.5, 64.6, 375.38, and 2092.56 seconds on a 2.53 GHz P4 processor for a(8) through a(14), respectively, the program in the link will sum the first 5^15 primes in 3.5 hours. [Comment reworded by _Jon E. Schoenfield_, Aug 01 2015]
%H A113633 Amiram Eldar, <a href="/A113633/b113633.txt">Table of n, a(n) for n = 0..24</a> (calculated using Kim Walisch's primesum program)
%H A113633 Cino Hilliard, <a href="http://groups.msn.com/First300billionprimes/sumfirst5nprimes.msnw">SumPrimes</a>. [broken link]
%H A113633 Kim Walisch, <a href="https://github.com/kimwalisch/primesum">Sum of the primes below x (primesum)</a>.
%F A113633 a(n) = A007504(A000351(n)). - _Michel Marcus_, Aug 01 2015
%e A113633 The first 5^1 primes add up to 28.
%t A113633 t = {}; c = 1; k = 3; s = 2; Do[ While[c < 5^n, If[PrimeQ[k], c++; s += k]; k += 2]; Print@s; AppendTo[t, s], {n, 0, 10}]; t (* _Robert G. Wilson v_, Jan 17 2006 *)
%Y A113633 Cf. A000351, A007504, A055680, A099825, A099826, A113634, A113635.
%K A113633 nonn
%O A113633 0,1
%A A113633 _Cino Hilliard_, Jan 15 2006
%E A113633 a(15) onwards from _Amiram Eldar_, Jul 01 2024