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 A074669 #26 May 18 2019 19:43:48
%S A074669 102359,102367,102397,102437,102497,102539,102547,102563,102587,
%T A074669 102593,102643,102647,102653,102673,102679,102763,102769,102793,
%U A074669 102859,102953,102967,102983,103289,103457,103529,103549,103567,103657,103687,103769,103867,103967,104239
%N A074669 Six-digit distinct-digit primes.
%C A074669 There are exactly 10239 six-digit primes with distinct digits.
%H A074669 Nathaniel Johnston, <a href="/A074669/b074669.txt">Table of n, a(n) for n = 1..10239</a> (full sequence)
%e A074669 a(1)=102359 because it is the first (smallest) 6-digit primes with all distinct digits.
%t A074669 Select[Range[100001, 999999, 2], Length[Union[IntegerDigits[ # ]]]==6 && PrimeQ[ # ]&]
%t A074669 Take[Select[Prime[Range[PrimePi[100000]+1,PrimePi[999999]]],Max[DigitCount[#]]==1&],50] (* _Harvey P. Dale_, Jan 09 2011 *)
%t A074669 Select[Sort[FromDigits/@Flatten[Permutations/@Subsets[Range[0,9],{6}],1]], IntegerLength[#] == 6&&PrimeQ[#]&] (* _Harvey P. Dale_, Jul 28 2017 *)
%o A074669 (PARI) is(n)=isprime(n) && #digits(n)==6 && #Set(digits(n))==6 \\ _Charles R Greathouse IV_, Feb 11 2017
%Y A074669 The first differences are in A074670. 7-digit distinct-digit primes are in A074667, see also A074668. 8-digit distinct-digit primes are in A074665, see also A074666.
%K A074669 fini,full,nonn,base
%O A074669 1,1
%A A074669 _Zak Seidov_, Aug 30 2002