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 A122211 #5 Mar 23 2020 09:47:33
%S A122211 6,12,30,66,156,180,228,336,366,558,750,840,894,978,1398,1410,1506,
%T A122211 1560,1578,1662,1794,1800,1812,1824,1890,1992,2094,2268,2334,2358,
%U A122211 2430,2604,2736,2742,2766,2802,2856,2922,3042,3312,3390,3702,3948,3954,3984,4170,4314
%N A122211 Numbers k such that the sum of squares of the first k^2 primes is a prime.
%C A122211 Corresponding primes A122209(a(n)) = A024450(a(n)^2) are listed in A122210(n) = {239087, 29194283, 13459558559, 2330212120559, ...}. All a(n) are of the form 6*m, where m = {1, 2, 5, 11, 26, 30, 38, 56, 61, 93, 125, 140, 149, 163, 233, 235, 251, 260, 263, 277, 299, 300, ...}. Because A122209(2*m-1) is an even number and A122209(3*m-1) == A122209(3*m+1) == 0 (mod 3) for m >= 1. [Edited by _Jinyuan Wang_, Mar 23 2020]
%F A122211 A122209(a(n)) = A024450(a(n)^2) = A122210(n).
%t A122211 s=0;Do[p=Prime[n];k=Sqrt[n];s=s+p*p;If[PrimeQ[s]&&IntegerQ[k],Print[{k,n,s}]],{n,1,10^7}]
%Y A122211 Cf. A024450, A098561, A098562, A122209, A122210.
%K A122211 nonn
%O A122211 1,1
%A A122211 _Alexander Adamchuk_, Aug 26 2006
%E A122211 More terms from _Jinyuan Wang_, Mar 23 2020