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 A162532 #16 Jul 20 2024 12:34:07
%S A162532 144,156,168,180,192,204,216,228,264,276,348,372,444,492,516,564,636,
%T A162532 708,732,804,852,876,948,996,1068,1164,1212,1236,1284,1308,1356,1524,
%U A162532 1572,1644,1668,1788,1812,1884,1956,2004,2076,2148,2172,2292,2316,2364
%N A162532 Numbers k whose largest divisor <= sqrt(k) equals 12.
%C A162532 See A161344 for more information.
%H A162532 Harvey P. Dale, <a href="/A162532/b162532.txt">Table of n, a(n) for n = 1..1000</a>
%F A162532 Numbers k such that A033676(k)=12.
%p A162532 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 3500 do if A033676(n) = 12 then printf("%d,",n) ; fi; od: # _R. J. Mathar_, Jul 13 2009
%t A162532 ld12Q[n_]:=First[Select[Reverse[Divisors[n]],#<=Sqrt[n]&]]==12;Select[ 12*Range[ 200], ld12Q] (* _Harvey P. Dale_, Mar 29 2013 *)
%Y A162532 Cf. A033676, A008578, A161344, A161345, A161424, A161835, A162526, A162527, A162528, A162529, A162530, A162531.
%K A162532 easy,nonn
%O A162532 1,1
%A A162532 _Omar E. Pol_, Jul 05 2009
%E A162532 More terms from _R. J. Mathar_, Jul 13 2009