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 A236224 #12 Dec 23 2024 14:53:43
%S A236224 65536,43112257,152631002882,33385561572483,45983115425144644,
%T A236224 711399724608324485,49372591600275192966,337814005167896360647,
%U A236224 6470424420848895009608,256716898101196243797129,984140019848381507625610,13321651934065547869899851
%N A236224 Sum of the sixteenth powers of the first n primes.
%H A236224 Robert Price, <a href="/A236224/b236224.txt">Table of n, a(n) for n = 1..1000</a>
%H A236224 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>
%H A236224 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 A236224 a(n) = sum(k = 1 .. n, prime(k)^16).
%t A236224 Table[Sum[Prime[k]^16, {k, n}], {n, 1000}]
%Y A236224 Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
%Y A236224 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A236224 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%Y A236224 Partial sums of A030635.
%K A236224 nonn,easy
%O A236224 1,1
%A A236224 _Robert Price_, Jan 20 2014