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 A366520 #12 Jan 04 2024 19:11:25
%S A366520 1,1,1,1,1,1,1,1,1,1,1,3,1,1,3,1,1,3,1,1,3,1,1,3,1,1,3,1,1,5,1,1,3,1,
%T A366520 5,3,1,1,3,5,1,3,1,1,5,1,1,3,1,5,3,1,1,3,5,7,3,1,1,5,1,1,7,1,5,3,1,1,
%U A366520 3,7,1,3,1,1,5,1,7,3,1,5,3,1,1,7,5,1,3,1,1,9,7,1,3,1,5,3,1,7,9,5
%N A366520 Largest odd divisor of n which is < sqrt(n), for n >= 2; a(1) = 1.
%H A366520 Andrew Howroyd, <a href="/A366520/b366520.txt">Table of n, a(n) for n = 1..10000</a>
%t A366520 Join[{1}, Table[Last[Select[Divisors[n], # < Sqrt[n] && OddQ[#] &]], {n, 2, 100}]]
%o A366520 (PARI) a(n) = {my(m=1); fordiv(n/2^valuation(n,2), d, if(d^2 < n, m=max(m,d))); m} \\ _Andrew Howroyd_, Oct 11 2023
%Y A366520 Cf. A000265, A060775, A093803, A366519.
%K A366520 nonn
%O A366520 1,12
%A A366520 _Ilya Gutkovskiy_, Oct 11 2023