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 A366519 #13 Jan 04 2024 19:04:05
%S A366519 1,1,1,1,1,1,1,1,3,1,1,3,1,1,3,1,1,3,1,1,3,1,1,3,5,1,3,1,1,5,1,1,3,1,
%T A366519 5,3,1,1,3,5,1,3,1,1,5,1,1,3,7,5,3,1,1,3,5,7,3,1,1,5,1,1,7,1,5,3,1,1,
%U A366519 3,7,1,3,1,1,5,1,7,3,1,5,9,1,1,7,5,1,3,1,1,9,7,1,3,1,5,3,1,7,9,5
%N A366519 Largest odd divisor of n which is <= sqrt(n).
%H A366519 Andrew Howroyd, <a href="/A366519/b366519.txt">Table of n, a(n) for n = 1..10000</a>
%t A366519 Table[Last[Select[Divisors[n], # <= Sqrt[n] && OddQ[#] &]], {n, 100}]
%o A366519 (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 A366519 Cf. A000265, A033676, A093803, A366520.
%K A366519 nonn
%O A366519 1,9
%A A366519 _Ilya Gutkovskiy_, Oct 11 2023