login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089386 Smallest number with digital product = 10^n. 1
1, 25, 455, 5558, 255558, 4555558, 55555588, 2555555588, 45555555588, 555555555888, 25555555555888, 455555555555888, 5555555555558888, 255555555555558888, 4555555555555558888, 55555555555555588888, 2555555555555555588888, 45555555555555555588888 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Michael S. Branicky, Table of n, a(n) for n = 0..750 (contiguous terms not exceeding 1000 digits)

PROG

(Python)

def a(n):

  if n == 0: return 1

  pow10, s = 10**n, ""

  for d in [8, 5, 4, 2]:

    while pow10%d == 0: pow10//=d; s += str(d)

  return int(s[::-1])

print([a(n) for n in range(18)]) # Michael S. Branicky, Jan 25 2021

CROSSREFS

Cf. A007954, A011557.

Sequence in context: A001811 A131279 A056069 * A014927 A059946 A118445

Adjacent sequences:  A089383 A089384 A089385 * A089387 A089388 A089389

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, Nov 08 2003

EXTENSIONS

More terms from Robert G. Wilson v, Nov 22 2003

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 25 03:45 EST 2021. Contains 341596 sequences. (Running on oeis4.)