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 A277057 #16 Sep 26 2019 06:25:34
%S A277057 123456789,11225079,1113198,210789,11115,11115,11115,11115,11115,
%T A277057 11115,11115,11115,11115,11115,11115,11115,11115,11115,11115,11115,
%U A277057 11115,11115,11115,11115,11115,11115,11115,11115,11115,11115,11115,11115,11115,11115,11115
%N A277057 Least k such that n-th repunit times k contains all digits from 1 to 9.
%C A277057 Starting from n=5, a(n)=A277059(10)=11115, and the corresponding pandigital numbers are 123499...98765 (n-4 nines). Actually, for all n, the resulting numbers are zeroless pandigitals.
%C A277057 a(1)-a(5) constitute row 10 of A277058.
%C A277057 a(n)*A002275(n) is 123456789, 123475869, 123564978, 234186579, 123498765, ...
%e A277057 a(2) = 11225079 because A002275(2)*11225079 = 11*11225079 = 123475869 that contains all digits from 1 to 9 and 11225079 is the least number with this property.
%o A277057 (PARI) isok(n) = my(d=digits(n)); vecmin(d) && (#Set(digits(n)) == 9);
%o A277057 a(n) = {if (n==1, return(123456789)); my(k=1); while(! isok(k*(10^n - 1)/9), k++); k;} \\ _Michel Marcus_, Sep 26 2019
%Y A277057 Cf. A002275, A050289, A277054, A277058, A277059.
%K A277057 nonn,base,easy
%O A277057 1,1
%A A277057 _Andrey Zabolotskiy_ and _Altug Alkan_, Sep 26 2016