login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078242 Smallest multiple of n using only digits 0 and 3. 4
3, 30, 3, 300, 30, 30, 3003, 3000, 333, 30, 33, 300, 3003, 30030, 30, 30000, 33303, 3330, 33003, 300, 3003, 330, 330303, 3000, 300, 30030, 333333333, 300300, 3303303, 30, 333033, 300000, 33, 333030, 30030, 33300, 333, 330030, 3003, 3000, 33333 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(n) = min{A169966(k): k > 1 and A169966(k) mod n = 0}. - Reinhard Zumkeller, Jan 10 2012

LINKS

Reinhard Zumkeller and Chai Wah Wu, Table of n, a(n) for n = 1..10000 First 1000 terms from Reinhard Zumkeller

PROG

(Haskell)

a078242 n = head [x | x <- tail a169966_list, mod x n == 0]

-- Reinhard Zumkeller, Jan 10 2012

(Python)

def A078242(n):

....if n > 0:

........for i in range(1, 2**n):

............x = 3*int(bin(i)[2:])

............if not x % n:

................return x

....return 0 # Chai Wah Wu, Dec 31 2014

CROSSREFS

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

Sequence in context: A176495 A318971 A082792 * A108739 A072973 A154054

Adjacent sequences:  A078239 A078240 A078241 * A078243 A078244 A078245

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, Nov 23 2002

EXTENSIONS

More terms from Ray Chandler, Jul 12 2004

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 15:14 EDT 2019. Contains 328030 sequences. (Running on oeis4.)