login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066151 Smallest n-digit number with A066150(n) divisors. 7

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)