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 A162526 #10 Feb 27 2019 02:50:48
%S A162526 36,42,48,54,60,66,78,102,114,138,174,186,222,246,258,282,318,354,366,
%T A162526 402,426,438,474,498,534,582,606,618,642,654,678,762,786,822,834,894,
%U A162526 906,942,978,1002,1038,1074,1086,1146,1158,1182,1194,1266,1338,1362
%N A162526 Numbers k whose largest divisor <= sqrt(k) equals 6.
%C A162526 See A161344 for more information.
%F A162526 Numbers k such that A033676(k)=6.
%p A162526 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) = 6 then printf("%d,",n) ; fi; od: # _R. J. Mathar_, Jul 13 2009
%t A162526 ld6Q[n_]:=Last[Select[Divisors[n],#<=Sqrt[n]&]]==6; Select[Range[ 1400],ld6Q] (* _Harvey P. Dale_, Mar 08 2012 *)
%Y A162526 Cf. A033676, A008578, A161344, A161345, A161424, A161835, A162527, A162528, A162529, A162530, A162531, A162532.
%K A162526 easy,nonn
%O A162526 1,1
%A A162526 _Omar E. Pol_, Jul 05 2009
%E A162526 More terms from _R. J. Mathar_, Jul 13 2009