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

Smallest multiple of n using all digits of (n-1) at least once and no others; or 0 if no such number exists.

1

`%I #5 Dec 05 2013 19:56:15
`

`%S 0,0,222,0,0,0,666666,0,888888888,0,110,0,221,0,0,0,1666,0,1881,0,
`

`%T 20202,1122,2222222222222222222222,2232,0,52,22626,2772,82882,0,
`

`%U 333033,0,23232,0,0,0,3663,0,38883,0,444440,114114,24444,333344,0,4554,66646
`

`%N Smallest multiple of n using all digits of (n-1) at least once and no others; or 0 if no such number exists.
`

`%C 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.
`

`%C 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
`

`%Y Cf. A083959.
`

`%K base,nonn
`

`%O 1,3
`

`%A _Amarnath Murthy_, May 20 2003
`

`%E Corrected and extended by _David Wasserman_, Dec 03 2004
`