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 A348287 #13 Dec 05 2021 10:55:07
%S A348287 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,12,22,23,24,25,
%T A348287 26,27,28,29,30,13,23,33,34,35,36,37,38,39,40,14,24,34,44,45,46,47,48,
%U A348287 49,50,15,25,35,45,55,56,57,58,59,60,16,26,36,46,56,66
%N A348287 Arrange nonzero digits of n in increasing order then append the zeros.
%C A348287 Shares 101 initial terms with A328447. First difference is A328447(101)=101 vs A348287(101)=110.
%e A348287 a(1010) = 1100,
%e A348287 a(1234567890) = 1234567890,
%e A348287 a(9876543210) = 1234567890.
%t A348287 a[n_] := 10^DigitCount[n, 10, 0] * FromDigits[Sort[IntegerDigits[n]]]; Array[a, 100, 0] (* _Amiram Eldar_, Oct 10 2021 *)
%o A348287 (PARI) a(n) = fromdigits(vecsort(digits(n), x->if(x,x,10)));
%o A348287 (Ruby) p Array.new(40) { |n|
%o A348287 n.to_s.gsub('0','a').split(//).sort.join.gsub('a','0').to_i
%o A348287 }
%o A348287 (Python)
%o A348287 def a(n): s = str(n); return int("".join(sorted(s)))*10**s.count('0')
%o A348287 print([a(n) for n in range(68)]) # _Michael S. Branicky_, Oct 10 2021
%Y A348287 Cf. A004185, A328447.
%K A348287 nonn,base
%O A348287 0,3
%A A348287 _Simon Strandgaard_, Oct 10 2021