|
%I #40 Aug 04 2022 15:04:44
%S 2,3,5,7,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,
%T 103,107,109,127,137,139,149,157,163,167,173,179,193,197,239,241,251,
%U 257,263,269,271,281,283,293,307,317,347,349,359,367,379,389
%N Primes with distinct digits.
%C This sequence has 283086 terms, the last being 987654103 = A007810(9). - _Jud McCranie_
%C Intersection of A010784 and A000040; A178788(a(n)) * A010051(a(n)) = 1. [_Reinhard Zumkeller_, Sep 25 2011]
%H Reinhard Zumkeller, <a href="/A029743/b029743.txt">Table of n, a(n) for n = 1..283086, full sequence</a>
%H Patrick De Geest, <a href="http://www.worldofnumbers.com/index.html">World!Of Numbers</a>
%t t={};Do[p=Prime[n];If[Select[Transpose[Tally[IntegerDigits[p]]][[2]],#>1 &]=={},AppendTo[t,p]],{n,77}];t (* _Jayanta Basu_, May 04 2013 *)
%t Select[Prime[Range[80]],Max[DigitCount[#]]<2&] (* _Harvey P. Dale_, Sep 13 2020 *)
%o (Haskell)
%o a029743 n = a029743_list !! (n-1)
%o a029743_list = filter ((== 1) . a010051) a010784_list
%o -- _Reinhard Zumkeller_, Sep 25 2011
%o (Python)
%o from sympy import isprime
%o from itertools import permutations as P
%o dist = [p for d in range(1, 11) for p in P("0123456789", d) if p[0] != "0"]
%o afull = [t for t in (int("".join(p)) for p in dist) if isprime(t)]
%o print(afull[:100]) # _Michael S. Branicky_, Aug 04 2022
%Y Cf. A000040, A007810, A010051, A010784, A178788.
%K nonn,fini,full,base
%O 1,1
%A _Patrick De Geest_
|
