This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A235159 #17 Mar 21 2018 16:25:57 %S A235159 1023467,1023487,1023697,1023769,1023857,1023947,1024357,1024379, %T A235159 1024579,1024589,1024693,1024697,1024783,1024853,1024957,1024963, %U A235159 1024987,1025347,1025483,1025693,1025749,1025789,1025839,1025873,1025897,1026359,1026439,1026457 %N A235159 Primes which have one or more occurrences of exactly seven different digits. %C A235159 The first term having a repeated digit is 10023649. %H A235159 Colin Barker, <a href="/A235159/b235159.txt">Table of n, a(n) for n = 1..2000</a> %t A235159 Select[Prime[Range[PrimePi[102*10^4],PrimePi[103*10^4]]],Count[ DigitCount[ #],0] ==3&] (* _Harvey P. Dale_, Mar 21 2018 *) %o A235159 (PARI) s=[]; forprime(n=1000000, 1030000, if(#vecsort(eval(Vec(Str(n))),,8)==7, s=concat(s, n))); s %Y A235159 Cf. A074667, A235154-A235158, A235160, A235161. %K A235159 nonn,base %O A235159 1,1 %A A235159 _Colin Barker_, Jan 04 2014