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 A098895 #7 Aug 05 2019 06:38:00 %S A098895 2,4,6,12,16,24,48,60,120,240,288,384,576,1152,2304,2688,5376,8064, %T A098895 16128,20160,40320,46080,92160,184320,368640,737280,983040,1966080, %U A098895 3932160,4423680,6635520,13271040,15925248,31850496,63700992,127401984 %N A098895 Number of divisors of the n-th superior highly composite number. %C A098895 Sequence A002201 gives the values of the n-th superior highly composite number N(n) and A000705 gives the values of the (prime) ratio N(n)/N(n-1). %D A098895 S. Ramanujan, Highly composite numbers, Proc. London Math. Soc., 14 (1915), 347-407. Reprinted in Collected Papers, Ed. G. H. Hardy et al., Cambridge 1927; Chelsea, NY, 1962, pp. 78-129. See esp. pp. 87, 115. %H A098895 Amiram Eldar, <a href="/A098895/b098895.txt">Table of n, a(n) for n = 1..3401</a> (calculated using the b-file at A000705) %H A098895 S. Ramanujan, <a href="http://www.imsc.res.in/~rao/ramanujan/CamUnivCpapers/Cpaper15/page1.htm">Highly Composite Numbers</a>. %F A098895 a(n) = a(n-1) * (1 + 1/k(n)), where k(n) is the p(n)-adic valuation of the n-th superior highly composite number N(n), with p(n) = N(n)/N(n-1) and N(0)=1. %e A098895 a(8)=60 because the eighth superior highly composite number, 5040, has 60 divisors. %Y A098895 Cf. A000705, A002201. %K A098895 nonn %O A098895 1,1 %A A098895 _David Terr_, Oct 14 2004