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.

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

This page as a plain text file.
%I A078247 #19 Feb 20 2025 19:07:19
%S A078247 8,8,888,8,80,888,8008,8,888888888,80,88,888,8008,8008,8880,80,88808,
%T A078247 888888888,88008,80,80808,88,880808,888,800,8008,8808888888,8008,
%U A078247 8808808,8880,888088,800,888888,88808,80080,888888888,888,88008,80808,80,88888,80808
%N A078247 Smallest multiple of n using only digits 0 and 8.
%C A078247 a(n) = min{A204095(k): k > 0 and A204095(k) mod n = 0}. [_Reinhard Zumkeller_, Jan 10 2012]
%H A078247 Reinhard Zumkeller, <a href="/A078247/b078247.txt">Table of n, a(n) for n = 1..998</a>
%t A078247 Module[{nn=10,lst},lst=Rest[FromDigits/@Tuples[{0,8},nn]];Table[SelectFirst[lst,Divisible[#,n]&],{n,50}]] (* _Harvey P. Dale_, Feb 20 2025 *)
%o A078247 (Haskell)
%o A078247 a078247 n = head [x | x <- tail a204095_list, mod x n == 0]
%o A078247 -- _Reinhard Zumkeller_, Jan 10 2012
%o A078247 (Python)
%o A078247 def a(n):
%o A078247     k = 1
%o A078247     while  8*int(bin(k)[2:])%n: k += 1
%o A078247     return 8*int(bin(k)[2:])
%o A078247 print([a(n) for n in range(1, 43)]) # _Michael S. Branicky_, Aug 08 2021
%Y A078247 Cf. A004290, A078241-A078248, A079339, A096681-A096688.
%K A078247 base,nonn
%O A078247 1,1
%A A078247 _Amarnath Murthy_, Nov 23 2002
%E A078247 More terms from _Ray Chandler_, Jul 12 2004