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 A192929 #25 Jan 12 2016 08:58:46 %S A192929 1,2,6,30,210,4620,120120,4084080,116396280,2677114440,310545275040, %T A192929 14440355289360,1068586291412640,114873026326858800, %U A192929 9419588158802421600,442720643463713815200,54011918502573085454400,8587895041909120587249600 %N A192929 Least highly abundant number with n distinct prime factors. %C A192929 a(n) is the least number in sequence A002093, with A001221(a(n)) = n. %D A192929 S. S. Pillai, Highly abundant numbers, Bull. Calcutta Math. Soc., 35, (1943), 141-156. %H A192929 L. Alaoglu and P. Erdős, <a href="http://www.renyi.hu/~p_erdos/1944-03.pdf">On highly composite and similar numbers</a>, Trans. Amer. Math. Soc., 56 (1944), 448-469. %H A192929 Wikipedia, <a href="http://en.wikipedia.org/wiki/Highly_abundant_number">Highly abundant number</a> %Y A192929 Cf. A001222, A002093, A225194. %K A192929 nonn %O A192929 0,2 %A A192929 _Enrique Pérez Herrero_, Jul 12 2011