|
|
A259146
|
|
Smallest prime with first n digits distinct.
|
|
1
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The sequence is complete: n=1..10.
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
(Python)
from sympy import nextprime
def a(n):
p = nextprime(10**(n-1))
while len(set(str(p)[:n])) < n: p = nextprime(p)
return p
for n in range(1, 11):
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,fini,full
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|