Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #21 Jul 08 2019 12:32:39
%S 6,60,840,7560,83160,720720,8648640,73513440,735134400,6983776800,
%T 97772875200,963761198400,9316358251200,97821761637600,
%U 866421317361600,8086598962041600,74801040398884800,897612484786617600
%N Smallest n-digit number with A066150(n) divisors.
%C Also largest highly composite number(A002182) with n digits. - _Amiram Eldar_, Jul 02 2019
%H Amiram Eldar, <a href="/A066151/b066151.txt">Table of n, a(n) for n = 1..1000</a>
%F a(n) = A005179(A066150(n)). - _Max Alekseyev_, Apr 29 2010
%e a(1) = 6 since 6 has 4 divisors and that is the record for 1-digit numbers.
%e 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 (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 Cf. A005179, A066150. Subsequence of A002182.
%K nonn,base,easy
%O 1,1
%A _N. J. A. Sloane_, Dec 13 2001
%E More terms from _Klaus Brockhaus_, Dec 17 2001
%E More terms from _David Wasserman_, Jan 25 2002