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 A028905 #22 Jul 05 2025 16:34:37
%S A028905 2,3,5,7,11,13,17,19,23,29,13,37,14,34,47,35,59,16,67,17,37,79,38,89,
%T A028905 79,11,13,17,19,113,127,113,137,139,149,115,157,136,167,137,179,118,
%U A028905 119,139,179,199,112,223,227,229,233,239,124,125,257,236,269
%N A028905 Arrange digits of primes in ascending order.
%C A028905 Leading zeros are discarded (e.g., 107, rearranged to 017, becomes 17).
%H A028905 Reinhard Zumkeller, <a href="/A028905/b028905.txt">Table of n, a(n) for n = 1..10000</a>
%F A028905 a(n) = A004185(A000040(n)). - _Reinhard Zumkeller_, Apr 03 2015
%F A028905 a(n) = prime(n) if prime(n) is in A028864. - _Alonso del Arte_, Nov 25 2019
%e A028905 The digits of 41 are 4, 1, which sorted are 1, 4; those are reinterpreted as 14.
%e A028905 The digits of 43 are 4, 3, which sorted are 3, 4; those are reinterpreted as 34.
%e A028905 The digits of 47 are 4, 7, which are already sorted, so 47 is not changed.
%t A028905 Table[FromDigits[Sort[IntegerDigits[Prime[n]]]], {n, 100}] (* _Alonso del Arte_, Nov 25 2019 *)
%o A028905 (Haskell)
%o A028905 a028905 = a004185 . a000040 -- _Reinhard Zumkeller_, Apr 03 2015
%o A028905 (PARI) eva(n) = subst(Pol(n), x, 10)
%o A028905 a(n) = eva(vecsort(digits(prime(n)))) \\ _Felix Fröhlich_, Nov 25 2019
%Y A028905 Cf. A028906, A028864.
%Y A028905 Cf. A004185, A000040.
%K A028905 nonn,base
%O A028905 1,1
%A A028905 _N. J. A. Sloane_
%E A028905 More terms from _Patrick De Geest_, Apr 1998
%E A028905 Offset corrected by _Reinhard Zumkeller_, Apr 03 2015