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 A162528 #12 Feb 27 2019 02:50:38
%S A162528 64,72,80,88,96,104,112,128,136,152,184,232,248,296,328,344,376,424,
%T A162528 472,488,536,568,584,632,664,712,776,808,824,856,872,904,1016,1048,
%U A162528 1096,1112,1192,1208,1256,1304,1336,1384,1432,1448,1528,1544,1576,1592,1688
%N A162528 Numbers k whose largest divisor <= sqrt(k) equals 8.
%C A162528 See A161344 for more information.
%F A162528 Numbers k such that A033676(k)=8.
%p A162528 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 2000 do if A033676(n) = 8 then printf("%d,",n) ; fi; od: # _R. J. Mathar_, Jul 13 2009
%t A162528 ld8Q[n_]:=Last[Select[Divisors[n],#<=Sqrt[n]&]]==8; Select[Range[ 2000], ld8Q] (* _Harvey P. Dale_, Apr 08 2017 *)
%Y A162528 Cf. A033676, A008578, A161344, A161345, A161424, A161835, A162526, A162527, A162529, A162530, A162531, A162532.
%K A162528 easy,nonn
%O A162528 1,1
%A A162528 _Omar E. Pol_, Jul 05 2009
%E A162528 More terms from _R. J. Mathar_, Jul 13 2009