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 A123258 #12 Nov 17 2018 21:00:13
%S A123258 1,2,4,6,6,12,12,24,36,48,30,60,30,40,60,120,90,180,120,240,90,120,
%T A123258 180,360,120,144,180,240,360,720,420,840,315,420,630,1260,420,560,840,
%U A123258 1680,315,360,420,504,630,840,1260,2520,360,420,504,560,630,720,840,1008
%N A123258 a(n) = n-th divisor of the smallest positive integer with at least n divisors.
%C A123258 a(n) = n-th divisor of A061799(n).
%e A123258 The smallest positive integer with at least 11 divisors is 60, which has 12 divisors.
%e A123258 So a(11) = the 11th divisor of 60, which is 30.
%t A123258 f[n_] := Block[{k = 1, d},While[d = Divisors[k]; Length[d] < n, k++ ];d[[n]]];Table[f[n], {n, 60}] (* _Ray Chandler_, Nov 11 2006 *)
%t A123258 Do[k = 1; While[Length[Divisors[k]] < n, k++ ]; Print[Divisors[k][[n]]], {n, 100}] (* _Ryan Propper_, Nov 12 2006 *)
%Y A123258 Cf. A061799.
%K A123258 nonn
%O A123258 1,2
%A A123258 _Leroy Quet_, Nov 06 2006
%E A123258 Extended by _Ray Chandler_, Nov 11 2006
%E A123258 More terms from _Ryan Propper_, Nov 12 2006