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 A066151 #21 Jul 08 2019 12:32:39 %S A066151 6,60,840,7560,83160,720720,8648640,73513440,735134400,6983776800, %T A066151 97772875200,963761198400,9316358251200,97821761637600, %U A066151 866421317361600,8086598962041600,74801040398884800,897612484786617600 %N A066151 Smallest n-digit number with A066150(n) divisors. %C A066151 Also largest highly composite number(A002182) with n digits. - _Amiram Eldar_, Jul 02 2019 %H A066151 Amiram Eldar, <a href="/A066151/b066151.txt">Table of n, a(n) for n = 1..1000</a> %F A066151 a(n) = A005179(A066150(n)). - _Max Alekseyev_, Apr 29 2010 %e A066151 a(1) = 6 since 6 has 4 divisors and that is the record for 1-digit numbers. %e A066151 a(1) = 6 since 6 has 4 divisors and k has at most 3 divisors for k < 6 and not more than 4 divisors for 6 < k <= 9. %o A066151 (PARI) a066151(m,n) = local(d,a,k,b,c); for(d=m,n,a=0; for(k=10^d,10^(d+1)-1,b=numdiv(k); if(b>a,a=b; c=k)); print1(c,",")) %Y A066151 Cf. A005179, A066150. Subsequence of A002182. %K A066151 nonn,base,easy %O A066151 1,1 %A A066151 _N. J. A. Sloane_, Dec 13 2001 %E A066151 More terms from _Klaus Brockhaus_, Dec 17 2001 %E A066151 More terms from _David Wasserman_, Jan 25 2002