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 A236209 #13 Dec 23 2024 14:53:43
%S A236209 128,2315,80440,903983,20391154,83139671,493478344,1387350083,
%T A236209 4792175530,22042051839,49554665950,144486543083,339240816964,
%U A236209 611059428071,1117682548534,2292393688371,4781045173190,7923788009211,13984499614534,23079619772925,34127018292022
%N A236209 Sum of the seventh powers of the first n primes.
%H A236209 Robert Price, <a href="/A236209/b236209.txt">Table of n, a(n) for n = 1..1000</a>
%H A236209 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>
%H A236209 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 A236209 a(n) = Sum_{k=1..n} prime(k)^7.
%t A236209 Table[Sum[Prime[k]^7, {k, n}], {n, 1000}]
%Y A236209 Cf. A085450 (smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n).
%Y A236209 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A236209 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%Y A236209 Partial sums of A092759.
%K A236209 nonn,easy
%O A236209 1,1
%A A236209 _Robert Price_, Jan 20 2014