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 A366524 #11 Jan 04 2024 19:12:11
%S A366524 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,4,1,1,1,4,1,1,1,4,1,1,1,4,1,1,
%T A366524 1,4,1,1,1,4,1,1,1,4,1,1,1,4,1,1,1,4,1,1,1,4,1,1,1,4,1,1,1,4,1,1,1,4,
%U A366524 1,1,1,4,1,1,1,4,1,1,1,4,1,1,1,4,1,1,1,4,1,9,1,4,1,1,1,4,1,1,9,4
%N A366524 Largest square divisor of n which is < sqrt(n), for n >= 2; a(1) = 1.
%H A366524 Andrew Howroyd, <a href="/A366524/b366524.txt">Table of n, a(n) for n = 1..10000</a>
%t A366524 Join[{1}, Table[Last[Select[Divisors[n], # < Sqrt[n] && IntegerQ[Sqrt[#]] &]], {n, 2, 100}]]
%o A366524 (PARI) a(n) = {my(m=1); fordiv(sqrtint(n/core(n)), d, if(d^4 < n, m=max(m,d))); m^2} \\ _Andrew Howroyd_, Oct 11 2023
%Y A366524 Cf. A008833, A060775, A366523.
%K A366524 nonn
%O A366524 1,20
%A A366524 _Ilya Gutkovskiy_, Oct 11 2023