Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Jan 04 2024 18:59:16
%S 1,1,1,2,1,2,1,2,3,2,1,3,1,2,3,2,1,3,1,2,3,2,1,3,5,2,3,2,1,5,1,2,3,2,
%T 5,6,1,2,3,5,1,6,1,2,5,2,1,6,7,5,3,2,1,6,5,7,3,2,1,6,1,2,7,2,5,6,1,2,
%U 3,7,1,6,1,2,5,2,7,6,1,5,3,2,1,7,5,2,3,2,1,6,7,2,3,2,5,6,1,7,3,10
%N Largest squarefree divisor of n which is <= sqrt(n).
%H Andrew Howroyd, <a href="/A366521/b366521.txt">Table of n, a(n) for n = 1..10000</a>
%t Table[Last[Select[Divisors[n], # <= Sqrt[n] && SquareFreeQ[#] &]], {n, 100}]
%o (PARI) a(n) = {my(m=1); fordiv(n, d, if(d^2 <= n && issquarefree(d), m=max(m,d))); m} \\ _Andrew Howroyd_, Oct 11 2023
%Y Cf. A007947, A033676, A089384, A366522.
%K nonn
%O 1,4
%A _Ilya Gutkovskiy_, Oct 11 2023