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 A055492 #11 Oct 02 2017 06:15:15
%S A055492 1,2,3,4,5,6,8,9,10,11,12,16,27,28
%N A055492 Numbers n such that LCM{1, ..., n} is a minimal number.
%C A055492 Minimal numbers (A007416): let A(h) = least positive integer having exactly h divisors, let d(n) = number of divisors of n; then n is minimal if A(d(n)) = n; i.e. if n is the least positive integer having the number of divisors it has.
%C A055492 Also the numbers n such that LCM (1, ..., n) is a highly composite number (A002182). - _Matthew Vandermast_, Jul 12 2004
%D A055492 J. Roberts, Lure of the Integers, Math. Assoc. of America, 1992, page 86.
%H A055492 M. E. Grost, <a href="http://www.jstor.org/stable/2315183">The smallest number with a given number of divisors</a>, Amer. Math. Monthly, 75 (1968), 725-729.
%Y A055492 Cf. A007416.
%Y A055492 Cf. A003418, A095921.
%K A055492 nonn,fini,full
%O A055492 1,2
%A A055492 _Robert G. Wilson v_, Jul 05 2000
%E A055492 Description corrected by _N. J. A. Sloane_, Feb 27 2003