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 A128165 #48 Jun 13 2021 03:22:44
%S A128165 1,2,6,10,20,22,28,155,488,664,992,6162,7840,7975,8793,18961,32422,
%T A128165 148220,231625,332198,459121,462932,2115894,8108930,10336641,11789731,
%U A128165 15500046,23483195,46571611,48582404,77033887,105390951,132421841,229481560,1224959312
%N A128165 Numbers k such that k divides 1 plus the sum of the first k primes.
%C A128165 a(44) > 4.4*10^10. - _Robert Price_, Dec 15 2013
%C A128165 a(50) > 10^14. - _Bruce Garner_, Jun 05 2021
%H A128165 Bruce Garner, <a href="/A128165/b128165.txt">Table of n, a(n) for n = 1..49</a>
%H A128165 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>
%t A128165 k = 0; s = 1; p = 2; A128165 = {}; While[k < 247336000, If[Mod[s += p, ++k] == 0, AppendTo[A128165, k]; Print[{k, p}]]; p = NextPrime@ p]; A128165
%o A128165 (PARI) is(n)=sum(i=1,n,prime(i),1)%n==0 \\ _Charles R Greathouse IV_, Nov 07 2014
%o A128165 (PARI) n=0; s=1; forprime(p=2,1e9, s+=p; if(s%n++==0, print1(n", "))) \\ _Charles R Greathouse IV_, Nov 07 2014
%Y A128165 Cf. A085450 (smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n).
%Y A128165 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248, A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%K A128165 hard,nonn
%O A128165 1,2
%A A128165 _Alexander Adamchuk_, Feb 22 2007
%E A128165 More terms from _Ryan Propper_, Apr 05 2007
%E A128165 a(34) from _Robert G. Wilson v_, Jan 21 2011
%E A128165 a(35) from _Robert Price_, Dec 15 2013