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 A236223 #11 Dec 23 2024 14:53:43
%S A236223 32768,14381675,30531959800,4778093469743,4182026262885394,
%T A236223 55367919276976151,2917790970786791944,18098918000661590243,
%U A236223 284734153465052835850,8913922901063237276799,32379184892907923206750,365825452844723230295243,1920923767836261141183844
%N A236223 Sum of the fifteenth powers of the first n primes.
%H A236223 Robert Price, <a href="/A236223/b236223.txt">Table of n, a(n) for n = 1..1000</a>
%H A236223 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>
%H A236223 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 A236223 a(n) = sum(k = 1 .. n, prime(k)^15).
%t A236223 Table[Sum[Prime[k]^15, {k, n}], {n, 1000}]
%t A236223 Accumulate[Prime[Range[15]]^15] (* _Harvey P. Dale_, Mar 09 2022 *)
%Y A236223 Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
%Y A236223 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A236223 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%K A236223 nonn,easy
%O A236223 1,1
%A A236223 _Robert Price_, Jan 20 2014