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 A224084 #40 Feb 04 2022 11:19:16
%S A224084 32,29014217650,1402410522779408458962,242700813972473727979856438,
%T A224084 39801461997088304647457657686237500,
%U A224084 34660028355420445358269199690982103830,449313345166550298019555516465462404833615242,521622464603890911352361262823355004060722502
%N A224084 a(n) is the sum of the first A122142(n) primes.
%C A224084 a(15) > 396037728209314158966816617669123060098902457685060543657534165383\
%C A224084 2287251689417. - _Paul W. Dyson_, Jan 04 2021
%C A224084 a(16) > 741988146562261280623405653926334331812789175312248159249998073717\
%C A224084 183180285452620103675. - _Bruce Garner_, May 09 2021
%C A224084 a(17) > 829476776252760811662536439998983292156543518510986088858270226839\
%C A224084 9456611816755432572891181. - _Paul W. Dyson_, Feb 04 2022
%H A224084 Paul W. Dyson, <a href="/A224084/b224084.txt">Table of n, a(n) for n = 1..16</a> (1..12 from Robert Price, 13..14 from Paul W. Dyson, 15 from Bruce Garner)
%H A224084 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>
%Y A224084 Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
%Y A224084 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A224084 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%K A224084 nonn
%O A224084 1,1
%A A224084 _Robert Price_, Mar 30 2013