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 A180489 #17 Mar 31 2018 10:58:37
%S A180489 1023456798,1023456789,1023467895,1023456798,1024375869,1023456798,
%T A180489 1023457698,1023458769,1023475689,1023468957,1023458769,1023654987,
%U A180489 1023458769,1023469875,1023467958,1023459786,1023457896,1023458976
%N A180489 Smallest pandigital number (A171102) divisible by the n-th prime A000040(n).
%C A180489 Digits may appear more than once in the multiple, resulting in 11-or-more-digit values of a(n). The first entry for which that happens is a(10545), because the smallest multiple of the 10545th prime 111119 that contains all the digits 0-9 is 92373 * 111119 = 10264395387, and all smaller primes have 10-digit pandigital multiples. - _David J. Seal_, Sep 18 2017
%H A180489 Ray Chandler, <a href="/A180489/b180489.txt">Table of n, a(n) for n=1..10000</a>
%e A180489 a(1) is the smallest pandigital number divisible by prime(1) = 2, which is 1023456798. - _David J. Seal_, Sep 18 2017
%t A180489 With[{s = Select[FromDigits@ # & /@ Permutations[Range[0, 9], {10}], # > 10^9 &]}, Table[SelectFirst[s, Divisible[#, Prime@ n] &], {n, 18}]] (* _Michael De Vlieger_, Sep 18 2017, after _Robert G. Wilson v_ at A171102 *)
%Y A180489 Cf. A050278, A061604, A171102, A274328.
%K A180489 nonn,base
%O A180489 1,1
%A A180489 _Lekraj Beedassy_, Sep 08 2010