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 A236222 #11 Dec 23 2024 14:53:43
%S A236222 16384,4799353,6108314978,684331387827,380434164971068,
%T A236222 4317810550670357,172695637110071286,971702322892955407,
%U A236222 12564538647431705216,310122771323231168697,1067066706544027489018,10079128002539035788707,48008355197454594590868
%N A236222 Sum of the fourteenth powers of the first n primes.
%H A236222 Robert Price, <a href="/A236222/b236222.txt">Table of n, a(n) for n = 1..1000</a>
%H A236222 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>
%H A236222 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 A236222 a(n) = sum(k = 1 .. n, prime(k)^14).
%t A236222 Table[Sum[Prime[k]^14, {k, n}], {n, 1000}]
%t A236222 Accumulate[Prime[Range[20]]^14] (* _Harvey P. Dale_, Nov 26 2014 *)
%Y A236222 Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
%Y A236222 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A236222 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%K A236222 nonn,easy
%O A236222 1,1
%A A236222 _Robert Price_, Jan 20 2014