The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A052014 Primes with distinct digits in descending order. 9

%I

%S 2,3,5,7,31,41,43,53,61,71,73,83,97,421,431,521,541,631,641,643,653,

%T 743,751,761,821,853,863,941,953,971,983,5431,6421,6521,7321,7541,

%U 7621,7643,8431,8521,8543,8641,8731,8741,8753,8761,9421,9431,9521,9631,9643

%N Primes with distinct digits in descending order.

%C Last term is a(87) = 98765431.

%H M. F. Hasler, <a href="/A052014/b052014.txt">Table of n, a(n) for n = 1..87</a>. [The full list of terms.]

%t Select[Prime[Range[1200]], Max[DigitCount[#]] == 1 && And@@Negative[ Differences[IntegerDigits[#]]]&] (* _Harvey P. Dale_, Oct 22 2011 *)

%t t={}; Do[p=Prime[n]; If[Select[Differences[IntegerDigits[p]], # >= 0&] == {}, AppendTo[t,p]], {n,1195}]; t (* _Jayanta Basu_, May 04 2013 *)

%o (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)

%Y Cf. A000040, A028867, A028864, A052015.

%K nonn,base,fini,full

%O 1,1

%A _Patrick De Geest_, Nov 15 1999

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 16 10:30 EDT 2021. Contains 343941 sequences. (Running on oeis4.)