cp's OEIS Frontend

A078245 Smallest multiple of n using only digits 0 and 6.

%I A078245 #20 Jun 06 2021 02:53:50
%S A078245 6,6,6,60,60,6,6006,600,666,60,66,60,6006,6006,60,6000,66606,666,
%T A078245 66006,60,6006,66,660606,600,600,6006,666666666,60060,6606606,60,
%U A078245 666066,60000,66,66606,60060,6660,666,66006,6006,600,66666,6006,6606606,660,6660,660606
%N A078245 Smallest multiple of n using only digits 0 and 6.
%C A078245 a(n) = min{A204093(k): k > 0 and A204093(k) mod n = 0}. [_Reinhard Zumkeller_, Jan 10 2012]
%H A078245 Michael S. Branicky, <a href="/A078245/b078245.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Reinhard Zumkeller)
%t A078245 With[{c=Rest[FromDigits/@Tuples[{0,6},10]]},Table[SelectFirst[c,Divisible[ #,n]&],{n,50}]] (* The program uses the SelectFirst function from Mathematica version 10 *) (* _Harvey P. Dale_, Apr 15 2015 *)
%o A078245 (Haskell)
%o A078245 a078245 n = head [x | x <- tail a204093_list, mod x n == 0]
%o A078245 -- _Reinhard Zumkeller_, Jan 10 2012
%o A078245 (Python)
%o A078245 def A204093(n): return int(bin(n)[2:].replace('1', '6'))
%o A078245 def a(n):
%o A078245     k = 1
%o A078245     while A204093(k)%n: k += 1
%o A078245     return A204093(k)
%o A078245 print([a(n) for n in range(1, 47)]) # _Michael S. Branicky_, Jun 06 2021
%Y A078245 Cf. A004290, A078241-A078248, A079339, A096681-A096688.
%K A078245 base,nonn
%O A078245 1,1
%A A078245 _Amarnath Murthy_, Nov 23 2002
%E A078245 More terms from _Ray Chandler_, Jul 12 2004