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 A235157 #16 Feb 06 2015 20:19:01 %S A235157 10243,10247,10253,10259,10267,10273,10289,10357,10369,10427,10429, %T A235157 10453,10457,10459,10463,10487,10529,10567,10589,10597,10627,10639, %U A235157 10657,10687,10723,10729,10739,10753,10789,10837,10847,10853,10859,10867,10937,10957 %N A235157 Primes which have one or more occurrences of exactly five different digits. %C A235157 The first term having a repeated digit is 100237. %C A235157 There are 2,529 5-digit primes in the sequence. _Harvey P. Dale_, Feb 06 2015 %H A235157 Colin Barker, <a href="/A235157/b235157.txt">Table of n, a(n) for n = 1..2500</a> %t A235157 Select[Prime[Range[1255,1355]],Max[DigitCount[#]]==1&] (* The program is only accurate for 5-digit primes, of which there are 2529 satisfying the definition *) (* _Harvey P. Dale_, Feb 06 2015 *) %o A235157 (PARI) s=[]; forprime(n=10000, 13000, if(#vecsort(eval(Vec(Str(n))),,8)==5, s=concat(s, n))); s %Y A235157 Cf. A235154-A235156, A235158-A235161. %Y A235157 Cf. A074671. %K A235157 nonn,base %O A235157 1,1 %A A235157 _Colin Barker_, Jan 04 2014