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 A065737 #21 Dec 13 2024 12:38:32
%S A065737 0,1,1,4,9,9,16,25,36,36,49,64,64,81,100,100,121,144,169,169,196,225,
%T A065737 225,256,289,324,324,361,400,400,441,484,484,529,576,625,625,676,729,
%U A065737 729,784,841,900,900,961,1024,1024,1089,1156,1225,1225,1296,1369,1369,1444
%N A065737 Largest square <= binomial(n,2).
%H A065737 Harry J. Smith, <a href="/A065737/b065737.txt">Table of n, a(n) for n = 1..1000</a>
%F A065737 a(n) = A048760(binomial(n,2)).
%F A065737 a(n) = A061288(n-1)^2 = A000290(A061288(n-1)) for n>=2. - _Alois P. Heinz_, Nov 07 2024
%t A065737 Floor[Sqrt[#]]^2&/@Binomial[Range[50],2] (* _Harvey P. Dale_, Feb 28 2020 *)
%o A065737 (PARI) a(n) = { sqrtint(binomial(n, 2))^2 } \\ _Harry J. Smith_, Oct 28 2009
%Y A065737 Cf. A048760, A000217, A000290, A061288, A065730-A065741.
%K A065737 easy,nonn
%O A065737 1,4
%A A065737 _Labos Elemer_, Nov 15 2001