cp's OEIS Frontend

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.

A074669 Six-digit distinct-digit primes.

Original entry on oeis.org

102359, 102367, 102397, 102437, 102497, 102539, 102547, 102563, 102587, 102593, 102643, 102647, 102653, 102673, 102679, 102763, 102769, 102793, 102859, 102953, 102967, 102983, 103289, 103457, 103529, 103549, 103567, 103657, 103687, 103769, 103867, 103967, 104239
Offset: 1

Views

Author

Zak Seidov, Aug 30 2002

Keywords

Comments

There are exactly 10239 six-digit primes with distinct digits.

Examples

			a(1)=102359 because it is the first (smallest) 6-digit primes with all distinct digits.
		

Crossrefs

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.

Programs

  • Mathematica
    Select[Range[100001, 999999, 2], Length[Union[IntegerDigits[ # ]]]==6 && PrimeQ[ # ]&]
    Take[Select[Prime[Range[PrimePi[100000]+1,PrimePi[999999]]],Max[DigitCount[#]]==1&],50] (* Harvey P. Dale, Jan 09 2011 *)
    Select[Sort[FromDigits/@Flatten[Permutations/@Subsets[Range[0,9],{6}],1]], IntegerLength[#] == 6&&PrimeQ[#]&] (* Harvey P. Dale, Jul 28 2017 *)
  • PARI
    is(n)=isprime(n) && #digits(n)==6 && #Set(digits(n))==6 \\ Charles R Greathouse IV, Feb 11 2017