This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A181060 a(n) is the smallest positive multiple of n whose decimal digits are all 0, 1 or 2. 9

%I

%S 1,2,12,12,10,12,21,112,12222,10,11,12,221,112,120,112,102,12222,1102,

%T 20,21,22,1012,120,100,1222,21222,112,1102,120,2201,1120,1122,102,210,

%U 22212,111,1102,10101,120,11111,210,2021,220,122220,1012,1222,1200

%N a(n) is the smallest positive multiple of n whose decimal digits are all 0, 1 or 2.

%H Inspired by Project Euler, Problem 303: <a href="http://projecteuler.net/index.php?section=problems&amp;id=303">Multiples with small digits</a>.

%e a(9)=12222 because 12222 is the smallest multiple of 9 whose decimal digits are all 0, 1 or 2.

%Y a(n)/n yields sequence A181061.

%K base,easy,nonn

%O 1,2

%A Herman Beeksma (herman.beeksma(AT)gmail.com), Oct 01 2010

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 .