login
A061604
Smallest multiple of n containing all 10 digits from 0 to 9.
6
1023456789, 1023456798, 1023456789, 1023457896, 1023467895, 1023456798, 1023456798, 1023457896, 1023456789, 1234567890, 1024375869, 1023457896, 1023456798, 1023456798, 1023467895, 1023457968, 1023457698, 1023456798
OFFSET
1,1
COMMENTS
It can be shown that for every positive integer there exist infinitely many multiples containing all the 10 digits.
LINKS
MATHEMATICA
With[{t=Sort[FromDigits[Join[{1}, #]]&/@Permutations[{2, 3, 4, 5, 6, 7, 8, 9, 0}]]}, Flatten[ Table[Select[t, Divisible[#, n]&, 1], {n, 20}]]] (* Harvey P. Dale, Aug 26 2014 *)
CROSSREFS
Cf. A171102.
Sequence in context: A218770 A292569 A204045 * A302096 A171102 A050278
KEYWORD
nonn,base,easy
AUTHOR
Amarnath Murthy, May 19 2001
EXTENSIONS
Corrected and extended by Patrick De Geest, Jun 04 2001
STATUS
approved