cp's OEIS Frontend

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.

A066151 Smallest n-digit number with A066150(n) divisors.

Original entry on oeis.org

6, 60, 840, 7560, 83160, 720720, 8648640, 73513440, 735134400, 6983776800, 97772875200, 963761198400, 9316358251200, 97821761637600, 866421317361600, 8086598962041600, 74801040398884800, 897612484786617600
Offset: 1

Views

Author

N. J. A. Sloane, Dec 13 2001

Keywords

Comments

Also largest highly composite number(A002182) with n digits. - Amiram Eldar, Jul 02 2019

Examples

			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.
		

Crossrefs

Cf. A005179, A066150. Subsequence of A002182.

Programs

  • 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,","))

Formula

a(n) = A005179(A066150(n)). - Max Alekseyev, Apr 29 2010

Extensions

More terms from Klaus Brockhaus, Dec 17 2001
More terms from David Wasserman, Jan 25 2002