login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078248 Smallest multiple of n using only digits 0 and 9. 19

%I #14 May 31 2014 09:49:25

%S 9,90,9,900,90,90,9009,9000,9,90,99,900,9009,90090,90,90000,99909,90,

%T 99009,900,9009,990,990909,9000,900,90090,999,900900,9909909,90,

%U 999099,900000,99,999090,90090,900,999,990090,9009,9000,99999,90090,9909909

%N Smallest multiple of n using only digits 0 and 9.

%C a(n) = min{A097256(k): k > 0 and A097256(k) mod n = 0}. [_Reinhard Zumkeller_, Jan 10 2012]

%H Reinhard Zumkeller, <a href="/A078248/b078248.txt">Table of n, a(n) for n = 1..1000</a>

%t With[{t=Flatten[Table[FromDigits[Join[{9},#]]&/@Tuples[{0,9},n],{n,0,6}]]},Flatten[Table[Select[t,Divisible[#,i]&,1],{i,50}]]] (* _Harvey P. Dale_, May 31 2014 *)

%o (Haskell)

%o a078248 n = head [x | x <- tail a097256_list, mod x n == 0]

%o -- _Reinhard Zumkeller_, Jan 10 2012

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

%K base,nonn

%O 1,1

%A _Amarnath Murthy_, Nov 23 2002

%E More terms from _Ray Chandler_, Jul 12 2004

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 26 14:37 EDT 2024. Contains 372003 sequences. (Running on oeis4.)