A078247 Smallest multiple of n using only digits 0 and 8.

8, 8, 888, 8, 80, 888, 8008, 8, 888888888, 80, 88, 888, 8008, 8008, 8880, 80, 88808, 888888888, 88008, 80, 80808, 88, 880808, 888, 800, 8008, 8808888888, 8008, 8808808, 8880, 888088, 800, 888888, 88808, 80080, 888888888, 888, 88008, 80808, 80, 88888, 80808

Offset

1,1

Comments

a(n) = min{A204095(k): k > 0 and A204095(k) mod n = 0}. [Reinhard Zumkeller, Jan 10 2012]

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..998

Prog

(Haskell)
a078247 n = head [x | x <- tail a204095_list, mod x n == 0]
-- Reinhard Zumkeller, Jan 10 2012
(Python)
def a(n):
    k = 1
    while  8*int(bin(k)[2:])%n: k += 1
    return 8*int(bin(k)[2:])
print([a(n) for n in range(1, 43)]) # Michael S. Branicky, Aug 08 2021

Crossrefs

Cf. A004290, A078241-A078248, A079339, A096681-A096688.

Sequence in context: A298905 A059196 A027504 * A273555 A213153 A132038

Adjacent sequences: A078244 A078245 A078246 * A078248 A078249 A078250

Keyword

base,nonn

Author

Amarnath Murthy, Nov 23 2002

Extensions

More terms from Ray Chandler, Jul 12 2004

Status

approved