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 A236214 #17 Dec 23 2024 14:53:43
%S A236214 256,6817,397442,6162243,220521124,1036251845,8012009286,24995572327,
%T A236214 103306557608,603552970569,1456444008010,4968923461931,12953848691052,
%U A236214 24642048968653,48453335630414,110713026041775,257543463646096,449250776643377,855318454200018
%N A236214 Sum of the eighth powers of the first n primes.
%H A236214 Robert Price, <a href="/A236214/b236214.txt">Table of n, a(n) for n = 1..1000</a>
%H A236214 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>
%H A236214 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 A236214 a(n) = Sum_{k=1..n} prime(k)^8.
%t A236214 Table[Sum[Prime[k]^8, {k, n}], {n, 1000}]
%t A236214 Accumulate[Prime[Range[20]]^8] (* _Harvey P. Dale_, Feb 25 2016 *)
%Y A236214 Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
%Y A236214 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A236214 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%Y A236214 Partial sums of A179645.
%K A236214 nonn,easy
%O A236214 1,1
%A A236214 _Robert Price_, Jan 20 2014