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 A236225 #18 Dec 23 2024 14:53:43
%S A236225 131072,129271235,763068724360,233393582711567,505680422082005338,
%T A236225 9156096341463343271,836396358227800107448,6316783216012602293387,
%U A236225 147366822776675571219490,7404514559506748686057599,29954631333669491864740510,486442572159704647268887427
%N A236225 Sum of the seventeenth powers of the first n primes.
%H A236225 Robert Price, <a href="/A236225/b236225.txt">Table of n, a(n) for n = 1..1000</a>
%H A236225 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>
%H A236225 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 A236225 a(n) = Sum_{k=1..n} prime(k)^17.
%t A236225 Table[Sum[Prime[k]^17, {k, n}], {n, 1000}]
%t A236225 Accumulate[Prime[Range[20]]^17] (* _Harvey P. Dale_, Nov 05 2016 *)
%Y A236225 Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
%Y A236225 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A236225 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%Y A236225 Partial sums of A138032.
%K A236225 nonn,easy
%O A236225 1,1
%A A236225 _Robert Price_, Jan 20 2014