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 A217600 #87 Sep 03 2022 09:40:48
%S A217600 4,24966,263736,1401992410,2040870112,3054955450,346739122490032,
%T A217600 499159078330000800,539391065522650998496,
%U A217600 25318239660367402306502991202,251882074412384639674100925616,31734804589156174948658730855096778,3209990334856119248883461357431048564,3910080232300154696097509520638192488259772
%N A217600 Sum of the squares of the first A111441(n) primes.
%C A217600 a(n) - A111441(a(n)) - 11 == 0 (mod 24) for n > 1. This is similar to the relation between A000027 and A024450. - _Karl-Heinz Hofmann_, Jan 11 2021
%H A217600 Paul W. Dyson, <a href="/A217600/b217600.txt">Table of n, a(n) for n = 1..16</a> (terms 1..12 from Robert Price, 13 from Willem Hengeveld, 14..15 from Bruce Garner).
%H A217600 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>
%o A217600 (PARI) n=s=0; forprime(p=2,1e8, s+=p^2; if(s%n++==0, print1(s", "))) \\ _Charles R Greathouse IV_, Apr 22 2015
%Y A217600 Cf. A085450 (smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n).
%Y A217600 Cf. also A007504, A045345, A171399, A128165, A233523, A050247, A050248, A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%K A217600 nonn
%O A217600 1,1
%A A217600 _Robert Price_, Mar 19 2013
%E A217600 a(13) from _Willem Hengeveld_, Nov 29 2020
%E A217600 a(14) from _Bruce Garner_, Dec 16 2020
%E A217600 a(15) from _Bruce Garner_, Dec 24 2020