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 A128171 #33 Apr 07 2021 20:39:48
%S A128171 1,2,4,5,6,10,12,46,1830,2086,6000,7681,8242,15204,43698,52054,154490,
%T A128171 211052,392767,4309540,6452151,8773101,15166410,26552623,176656106,
%U A128171 180281161,568507964,608235488,620790480,1053296976,1627363527,3740702866,20254119186
%N A128171 Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^7.
%C A128171 a(43) > 1.4*10^13. - _Bruce Garner_, Apr 07 2021
%H A128171 Bruce Garner, <a href="/A128171/b128171.txt">Table of n, a(n) for n = 1..42</a> (first 35 terms from Robert Price)
%H A128171 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>
%t A128171 s = 1; Do[s = s + Prime[n]^7; If[ Mod[s, n] == 0, Print[n]], {n, 1000000}]
%Y A128171 Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
%Y A128171 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A128171 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%K A128171 hard,nonn
%O A128171 1,2
%A A128171 _Alexander Adamchuk_, Feb 22 2007, Feb 23 2007
%E A128171 More terms from _Sean A. Irvine_, Jan 18 2011
%E A128171 a(27)-a(35) from _Robert Price_, Dec 03 2013