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 A059172 #24 Mar 10 2020 10:24:33
%S A059172 8,16,27,32,48,54,64,72,81,96,108,125,128,144,160,162,192,200,216,224,
%T A059172 243,250,256,288,320,324,343,375,384,392,400,405,432,448,486,500,512,
%U A059172 567,576,625,640,648,675,686,704,729,768,784,800,832,864,896,960,968
%N A059172 Numbers k such that k/rad(k) > sqrt(k) where rad(k) is the largest squarefree number dividing k.
%C A059172 Numbers k which have measure of smoothness J bigger as 2. Where J = log(k)/log(rad(k)), where rad(k) is product of distinct prime divisors of k. - _Artur Jasinski_, Feb 02 2010
%H A059172 Amiram Eldar, <a href="/A059172/b059172.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Harvey P. Dale)
%e A059172 48 is included because 6 is largest squarefree to divide 48 and 48 /6 = 8 > sqrt(48).
%t A059172 aa = {}; Do[kk = FactorInteger[c]; nn = 1; Do[nn = nn*kk[[n]][[1]], {n, 1, Length[kk]}]; If[Log[c]/Log[nn] >= 2,AppendTo[aa, c]], {c, 2, 1000}]; aa (* _Artur Jasinski_, Feb 02 2010 *)
%t A059172 Select[Range[1000],#/Last[Select[Divisors[#],SquareFreeQ]]>Sqrt[#]&] (* _Harvey P. Dale_, Dec 14 2017 *)
%Y A059172 Cf. A003557, A007947.
%K A059172 nonn
%O A059172 1,1
%A A059172 _Leroy Quet_, Feb 14 2001