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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A061604 Smallest multiple of n containing all 10 digits from 0 to 9. 6

%I #11 May 15 2018 21:15:45

%S 1023456789,1023456798,1023456789,1023457896,1023467895,1023456798,

%T 1023456798,1023457896,1023456789,1234567890,1024375869,1023457896,

%U 1023456798,1023456798,1023467895,1023457968,1023457698,1023456798

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

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

%H Alois P. Heinz, <a href="/A061604/b061604.txt">Table of n, a(n) for n = 1..1000</a>

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

%Y Cf. A171102.

%K nonn,base,easy

%O 1,1

%A _Amarnath Murthy_, May 19 2001

%E Corrected and extended by _Patrick De Geest_, Jun 04 2001

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 December 3 03:10 EST 2023. Contains 367531 sequences. (Running on oeis4.)