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 A236182 #17 Dec 23 2024 14:53:43
%S A236182 64,793,16418,134067,1905628,6732437,30870006,77915887,225951776,
%T A236182 820775097,1708278778,4274005187,9024109428,15345472477,26124687806,
%U A236182 48289048935,90469582576,141989956937,232448339106,360548623027,511882849316,754970304837,1081910678206
%N A236182 Sum of the sixth powers of the first n primes.
%H A236182 Robert Price, <a href="/A236182/b236182.txt">Table of n, a(n) for n = 1..1000</a>
%H A236182 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>
%H A236182 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>, SeqFan Mailing List, Aug 01 2013.
%F A236182 a(n) = Sum_{k = 1..n} prime(k)^6.
%t A236182 Table[Sum[Prime[k]^6, {k, n}], {n, 100}]
%t A236182 Accumulate[Prime[Range[30]]^6] (* _Harvey P. Dale_, Oct 29 2023 *)
%o A236182 (PARI) a(n) = sum(k=1, n, prime(k)^6); \\ _Michel Marcus_, Mar 01 2022
%Y A236182 Cf. A030516 (6th powers of primes).
%Y A236182 Cf. A085450 (smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n).
%Y A236182 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A236182 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%K A236182 nonn,easy
%O A236182 1,1
%A A236182 _Robert Price_, Jan 19 2014