login
Arrange digits of primes in ascending order.
4

%I #20 Nov 28 2019 02:26:52

%S 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 79,11,13,17,19,113,127,113,137,139,149,115,157,136,167,137,179,118,

%U 119,139,179,199,112,223,227,229,233,239,124,125,257,236,269

%N Arrange digits of primes in ascending order.

%C Leading zeros are discarded (e.g., 107, rearranged to 017, becomes 17).

%H Reinhard Zumkeller, <a href="/A028905/b028905.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A004185(A000040(n)). - _Reinhard Zumkeller_, Apr 03 2015

%F a(n) = prime(n) if prime(n) is in A028864. - _Alonso del Arte_, Nov 25 2019

%e The digits of 41 are 4, 1, which sorted are 1, 4; those are reinterpreted as 14.

%e The digits of 43 are 4, 3, which sorted are 3, 4; those are reinterpreted as 34.

%e The digits of 47 are 4, 7, which are already sorted, so 47 is not changed.

%t Table[FromDigits[Sort[IntegerDigits[Prime[n]]]], {n, 100}] (* _Alonso del Arte_, Nov 25 2019 *)

%o (Haskell)

%o a028905 = a004185 . a000040 -- _Reinhard Zumkeller_, Apr 03 2015

%o (PARI) eva(n) = subst(Pol(n), x, 10)

%o a(n) = eva(vecsort(digits(prime(n)))) \\ _Felix Fröhlich_, Nov 25 2019

%Y Cf. A028906, A028864.

%Y Cf. A004185, A000040.

%K nonn,base

%O 1,1

%A _N. J. A. Sloane_

%E More terms from _Patrick De Geest_, April 1998

%E Offset corrected by _Reinhard Zumkeller_, Apr 03 2015