Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #24 Jan 26 2022 08:30:00
%S 103,107,109,127,137,139,149,157,163,167,173,179,193,197,239,241,251,
%T 257,263,269,271,281,283,293,307,317,347,349,359,367,379,389,397,401,
%U 409,419,421,431,439,457,461,463,467,479,487,491,503,509,521,523,541,547
%N Primes which have one or more occurrences of exactly three different digits.
%C The first term having a repeated digit is 1009.
%H Christopher M. Conrey, <a href="/A235155/b235155.txt">Table of n, a(n) for n = 1..10000</a> (first 2000 terms from Colin Barker)
%H Christopher M. Conrey, <a href="/A235155/a235155.txt">MATLAB Program</a>
%t Select[Prime[Range[200]],Count[DigitCount[#],0]==7&] (* _Harvey P. Dale_, Jul 27 2020 *)
%o (PARI) s=[]; forprime(n=100, 1000, if(#vecsort(eval(Vec(Str(n))),,8)==3, s=concat(s, n))); s
%o (MATLAB) %See Conrey Link
%Y Cf. A235154, A235156, A235157, A235158, A235159, A235160, A235161.
%Y Cf. A074675.
%K nonn,base
%O 1,1
%A _Colin Barker_, Jan 04 2014