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 A232554 #19 Feb 03 2025 15:35:59
%S A232554 1,1764,60516,82369,529984,2056356,2798929,3534400,18181696,38900169,
%T A232554 96020401,97121025,335988900,455907904,457318225,617820736,1334513961,
%U A232554 1599200100,2176689025,3279852900,4464244225,8586616896,15688815025,24514164900,33366502225
%N A232554 Square numbers whose sum of square divisors is also square.
%H A232554 Amiram Eldar, <a href="/A232554/b232554.txt">Table of n, a(n) for n = 1..1000</a>
%F A232554 a(n) = A046655(n)^2.
%e A232554 60516 = 246^2. Sum of square divisors: 60516 + 15129 + 6724 + 1681 + 36 + 9 + 4 + 1 = 84100 = 290^2.
%t A232554 f[p_, e_] := (p^(2*(1 + Floor[e/2])) - 1)/(p^2 - 1); A035316[1] = 1; A035316[n_] := Times @@ f @@@ FactorInteger[n];
%t A232554 Select[Range[200000]^2, IntegerQ[Sqrt[A035316[#]]]&] (* _Amiram Eldar_, Aug 12 2023 *)
%t A232554 ssdQ[n_]:=IntegerQ[Sqrt[Total[Select[Divisors[n],IntegerQ[Sqrt[#]]&]]]]; Select[Range[200000]^2,ssdQ] (* _Harvey P. Dale_, Feb 03 2025 *)
%o A232554 (PARI) {for(n=1,10^5,m=n*n;k=sumdiv(m,d,d*issquare(d));if(issquare(k),print(m)))}
%Y A232554 Cf. A035316, A046655, A232555, A232556, A232557.
%K A232554 nonn
%O A232554 1,2
%A A232554 _Antonio Roldán_, Nov 26 2013