A052014 Primes with distinct digits in descending order.
2, 3, 5, 7, 31, 41, 43, 53, 61, 71, 73, 83, 97, 421, 431, 521, 541, 631, 641, 643, 653, 743, 751, 761, 821, 853, 863, 941, 953, 971, 983, 5431, 6421, 6521, 7321, 7541, 7621, 7643, 8431, 8521, 8543, 8641, 8731, 8741, 8753, 8761, 9421, 9431, 9521, 9631, 9643
Offset: 1
Links
- M. F. Hasler, Table of n, a(n) for n = 1..87. [The full list of terms.]
Programs
-
Maple
b:= proc(n) `if`(isprime(n), n, [][]), seq( b(parse(cat(n, j))), j=1..irem(n, 10)-1) end: sort([seq(b(n), n=1..9)])[]; # Alois P. Heinz, Jun 16 2025
-
Mathematica
Select[Prime[Range[1200]], Max[DigitCount[#]] == 1 && And@@Negative[ Differences[IntegerDigits[#]]]&] (* Harvey P. Dale, Oct 22 2011 *) t={}; Do[p=Prime[n]; If[Select[Differences[IntegerDigits[p]], # >= 0&] == {}, AppendTo[t,p]], {n,1195}]; t (* Jayanta Basu, May 04 2013 *)
-
PARI
A052014=[]; for( i=1,1023, c=-1; isprime( t=sum( j=0,9, if(bittest(i,j),j*10^c++))) & A052014=concat(A052014,t)); A052014=vecsort(A052014)
Comments