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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A004290 Least positive multiple of n that when written in base 10 uses only 0's and 1's. 26
0, 1, 10, 111, 100, 10, 1110, 1001, 1000, 111111111, 10, 11, 11100, 1001, 10010, 1110, 10000, 11101, 1111111110, 11001, 100, 10101, 110, 110101, 111000, 100, 10010, 1101111111, 100100, 1101101, 1110, 111011, 100000, 111111, 111010 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

a(n) = min{A007088(k): k > 0 and A007088(k) mod n = 0}. [Reinhard Zumkeller, Jan 10 2012]

LINKS

T. D. Noe, Table of n, a(n) for n = 0..1999 (from Ed Pegg link)

Ed Pegg Jr., 'Binary' Puzzle

PROG

(Haskell)

a004290 0 = 0

a004290 n = head [x | x <- tail a007088_list, mod x n == 0]

-- Reinhard Zumkeller, Jan 10 2012

CROSSREFS

Cf. A004283-A004289, A078241-A078248, A079339, A096681-A096688.

Sequence in context: A004284 A119484 A100751 * A159551 A105991 A103581

Adjacent sequences:  A004287 A004288 A004289 * A004291 A004292 A004293

KEYWORD

nonn,base,nice

AUTHOR

David W. Wilson

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 24 00:43 EDT 2013. Contains 225613 sequences.