A061604 Smallest multiple of n containing all 10 digits from 0 to 9.

1023456789, 1023456798, 1023456789, 1023457896, 1023467895, 1023456798, 1023456798, 1023457896, 1023456789, 1234567890, 1024375869, 1023457896, 1023456798, 1023456798, 1023467895, 1023457968, 1023457698, 1023456798

Offset: 1

Author

Amarnath Murthy, May 19 2001

Keywords

• nonn
• base
• easy

Comments

It can be shown that for every positive integer there exist infinitely many multiples containing all the 10 digits.

Links

• Alois P. Heinz, Table of n, a(n) for n = 1..1000

Crossrefs

Cf. A171102.

Programs

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 *)

Extensions

Corrected and extended by Patrick De Geest, Jun 04 2001