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 A162529 #7 Feb 27 2019 02:50:43
%S A162529 81,90,99,108,117,126,135,153,162,171,189,207,243,261,279,333,369,387,
%T A162529 423,477,531,549,603,639,657,711,747,801,873,909,927,963,981,1017,
%U A162529 1143,1179,1233,1251,1341,1359,1413,1467,1503,1557,1611,1629,1719,1737,1773
%N A162529 Numbers k whose largest divisor <= sqrt(k) equals 9.
%C A162529 See A161344 for more information.
%F A162529 Numbers k such that A033676(k)=9.
%p A162529 A033676 := proc(n) local dvs; dvs := sort(convert(numtheory[divisors](n),list)) ; op(floor((nops(dvs)+1)/2) ,dvs) ; end: for n from 1 to 2500 do if A033676(n) = 9 then printf("%d,",n) ; fi; od: # _R. J. Mathar_, Jul 13 2009
%t A162529 lst = {}; For[n = 1, n <= 5000, n++, If[Last[Select[Divisors[n], # <= Sqrt@n &]] == 9, PrependTo[lst, n]]]; Reverse@lst (* Jasper Mulder (jasper.mulder(AT)planet.nl), Jul 14 2009 *)
%Y A162529 Cf. A033676, A008578, A161344, A161345, A161424, A161835, A162526, A162527, A162528, A162530, A162531, A162532.
%K A162529 easy,nonn
%O A162529 1,1
%A A162529 _Omar E. Pol_, Jul 05 2009
%E A162529 More terms from _R. J. Mathar_ and Jasper Mulder (jasper.mulder(AT)planet.nl), Jul 13 2009