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.

Showing 1-1 of 1 results.

A182681 a(n) is the smallest n-digit number with exactly 11 divisors, a(n) = 0 if no such number exists.

Original entry on oeis.org

0, 0, 0, 1024, 59049, 0, 9765625, 0, 282475249, 0, 25937424601, 137858491849, 2015993900449, 41426511213649, 420707233300201, 4808584372417849, 13422659310152401, 174887470365513049, 1822837804551761449, 15516041187205853449, 110462212541120451001, 1091533853073393531649
Offset: 1

Views

Author

Jaroslav Krizek, Nov 27 2010

Keywords

Comments

a(n) is the smallest n-digit number of the form p^10 (p = prime), a(n) = 0 if no such number exists.

Crossrefs

See A182682(n) - the largest n-digit number with exactly 11 divisors.
Cf. A030629 (numbers with 11 divisors).

Programs

  • PARI
    a(n)=(10^n>n=nextprime(sqrtn(10^(n-1),10))^10)*n  \\ M. F. Hasler, Nov 27 2010

Formula

A000005(a(n)) = 11.
a(n) = min { 0 } union ( A030629 intersect [10^(n-1), 10^n-1] )
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.