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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A083958 Smallest multiple of n using all digits of (n-1) at least once and no others; or 0 if no such number exists. 1
 0, 0, 222, 0, 0, 0, 666666, 0, 888888888, 0, 110, 0, 221, 0, 0, 0, 1666, 0, 1881, 0, 20202, 1122, 2222222222222222222222, 2232, 0, 52, 22626, 2772, 82882, 0, 333033, 0, 23232, 0, 0, 0, 3663, 0, 38883, 0, 444440, 114114, 24444, 333344, 0, 4554, 66646 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS If n contains all odd digits then a(n+1) = 0. If n+1 is not divisible by 5 and n contains an even digit then a(n+1) is nonzero. Infinitely many triples of successive zeros are there. It's not clear whether or not a digit that occurs twice in n-1 is required to occur twice in a(n). The first time it matters is a(101), which is either 101 or 1010. - David Wasserman, Dec 03 2004 LINKS Table of n, a(n) for n=1..47. CROSSREFS Cf. A083959. Sequence in context: A210135 A013548 A300517 * A083959 A078212 A078251 Adjacent sequences: A083955 A083956 A083957 * A083959 A083960 A083961 KEYWORD base,nonn AUTHOR Amarnath Murthy, May 20 2003 EXTENSIONS Corrected and extended by David Wasserman, Dec 03 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 10 17:45 EDT 2024. Contains 375792 sequences. (Running on oeis4.)