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 A065741 #14 Dec 13 2024 12:38:13
%S A065741 1,4,9,16,25,49,49,81,81,121,121,196,169,225,256,324,289,441,361,529,
%T A065741 484,576,529,841,625,841,784,1024,841,1296,961,1296,1156,1444,1296,
%U A065741 1849,1369,1764,1681,2209,1681,2500,1849,2500,2304,2601,2209,3364,2401
%N A065741 Largest square <= sum of squares of divisors of n.
%H A065741 Harry J. Smith, <a href="/A065741/b065741.txt">Table of n, a(n) for n=1..1000</a>
%F A065741 a(n) = A048760(A001157(n)).
%t A065741 Table[Floor[Sqrt[DivisorSigma[2, w]]//N]^2, {w, 1, 100}]
%o A065741 (PARI) a(n) = { sqrtint(sigma(n,2))^2 } \\ _Harry J. Smith_, Oct 29 2009
%Y A065741 Cf. A001157, A048760, A065730-A065741.
%K A065741 easy,nonn
%O A065741 1,2
%A A065741 _Labos Elemer_, Nov 15 2001