This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A061604 #11 May 15 2018 21:15:45
%S A061604 1023456789,1023456798,1023456789,1023457896,1023467895,1023456798,
%T A061604 1023456798,1023457896,1023456789,1234567890,1024375869,1023457896,
%U A061604 1023456798,1023456798,1023467895,1023457968,1023457698,1023456798
%N A061604 Smallest multiple of n containing all 10 digits from 0 to 9.
%C A061604 It can be shown that for every positive integer there exist infinitely many multiples containing all the 10 digits.
%H A061604 Alois P. Heinz, <a href="/A061604/b061604.txt">Table of n, a(n) for n = 1..1000</a>
%t A061604 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 A061604 Cf. A171102.
%K A061604 nonn,base,easy
%O A061604 1,1
%A A061604 _Amarnath Murthy_, May 19 2001
%E A061604 Corrected and extended by _Patrick De Geest_, Jun 04 2001