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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066151 Smallest n-digit number with A066150(n) divisors. 7
 6, 60, 840, 7560, 83160, 720720, 8648640, 73513440, 735134400, 6983776800, 97772875200, 963761198400, 9316358251200, 97821761637600, 866421317361600, 8086598962041600, 74801040398884800, 897612484786617600 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Also largest highly composite number(A002182) with n digits. - Amiram Eldar, Jul 02 2019 LINKS Amiram Eldar, Table of n, a(n) for n = 1..1000 FORMULA a(n) = A005179(A066150(n)). - Max Alekseyev, Apr 29 2010 EXAMPLE a(1) = 6 since 6 has 4 divisors and that is the record for 1-digit numbers. 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. PROG (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, ", ")) CROSSREFS Cf. A005179, A066150. Subsequence of A002182. Sequence in context: A302102 A168478 A101470 * A339191 A000407 A099708 Adjacent sequences: A066148 A066149 A066150 * A066152 A066153 A066154 KEYWORD nonn,base,easy AUTHOR N. J. A. Sloane, Dec 13 2001 EXTENSIONS More terms from Klaus Brockhaus, Dec 17 2001 More terms from David Wasserman, Jan 25 2002 STATUS approved

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.

Last modified September 27 19:23 EDT 2023. Contains 365714 sequences. (Running on oeis4.)