[go: up one dir, main page]

login
A078247
Smallest multiple of n using only digits 0 and 8.
3
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
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
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy, Nov 23 2002
EXTENSIONS
More terms from Ray Chandler, Jul 12 2004
STATUS
approved