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 A236216 #12 Dec 23 2024 14:53:43
%S A236216 1024,60073,9825698,292300947,26229725548,164088217397,2180082117846,
%T A236216 8311148375647,49737659589296,470444892889497,1290073179870298,
%U A236216 6098657552288147,19521316862440548,41132799175724797,93731931411554846,268619401777067895,779736155077709296
%N A236216 Sum of the tenth powers of the first n primes.
%H A236216 Robert Price, <a href="/A236216/b236216.txt">Table of n, a(n) for n = 1..1000</a>
%H A236216 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>
%H A236216 V. 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 A236216 a(n) = Sum_{k=1..n} prime(k)^10.
%t A236216 Table[Sum[Prime[k]^10, {k, n}], {n, 1000}]
%Y A236216 Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
%Y A236216 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A236216 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%Y A236216 Partial sums of A030629.
%K A236216 nonn,easy
%O A236216 1,1
%A A236216 _Robert Price_, Jan 20 2014