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 A236221 #17 Dec 23 2024 14:53:43
%S A236221 8192,1602515,1222305640,98111316047,34620823459978,337495930052231,
%T A236221 10242073962958168,52295057425215227,556331419361682610,
%U A236221 10816960132320284799,35234506429765327390,278803730645846632787,1203906832960860262108,2922170957243151047351
%N A236221 Sum of the thirteenth powers of the first n primes.
%H A236221 Robert Price, <a href="/A236221/b236221.txt">Table of n, a(n) for n = 1..1000</a>
%H A236221 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>
%H A236221 Vladimir Shevelev, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2013-August/011512.html">Asymptotics of sum of the first n primes with a remainder term</a>
%F A236221 a(n) = Sum_{k=1..n} prime(k)^13.
%t A236221 Table[Sum[Prime[k]^13, {k, n}], {n, 100}]
%Y A236221 Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
%Y A236221 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A236221 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%Y A236221 Partial sums of A138031.
%K A236221 nonn,easy
%O A236221 1,1
%A A236221 _Robert Price_, Jan 20 2014