The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A074667 Seven-digit distinct-digit primes. 14
 1023467, 1023487, 1023697, 1023769, 1023857, 1023947, 1024357, 1024379, 1024579, 1024589, 1024693, 1024697, 1024783, 1024853, 1024957, 1024963, 1024987, 1025347, 1025483, 1025693, 1025749, 1025789, 1025839, 1025873, 1025897, 1026359, 1026439 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The last term is a(33950) = 9876413. - Giovanni Resta, Mar 19 2013 LINKS Daniel Starodubtsev, Table of n, a(n) for n = 1..33950 (complete sequence, terms 1..10000 from Nathaniel Johnston) EXAMPLE a(1)=1023467 because it is the first (smallest) 7-digit prime with all distinct digits. MAPLE lim:=pi(1026439): for n from pi(1000000) to lim do p:=ithprime(n): d:=[op(convert(p, base, 10))]: ddig:=true: for k from 0 to 9 do if(numboccur(k, d)>1)then ddig:=false: break: fi: od: if(ddig)then printf("%d, ", p): fi: od: # Nathaniel Johnston, Jun 22 2011 MATHEMATICA Select[Range[1023457, 9876543, 2], Length[Union[IntegerDigits[ # ]]]==7 &&PrimeQ[ # ]&] PROG (PARI) is(n)=isprime(n) && #digits(n)==7 && #Set(digits(n))==7 \\ Charles R Greathouse IV, Feb 11 2017 CROSSREFS The first differences are in A074668. Cf. A073532 (Number of n-digit primes with all digits distinct). - Jon E. Schoenfield, Aug 13 2017 Sequence in context: A254304 A346266 A218019 * A235159 A235695 A206053 Adjacent sequences:  A074664 A074665 A074666 * A074668 A074669 A074670 KEYWORD fini,full,nonn,base,easy AUTHOR Zak Seidov, Aug 30 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 20 11:42 EDT 2021. Contains 347584 sequences. (Running on oeis4.)