|
|
A212290
|
|
Difference between the smallest 10^n-bit prime and 2^(10^n-1).
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
2^99+255 is the smallest 100-bit prime, 2^999+1239 is the smallest 1000-bit prime, etc.
|
|
PROG
|
(PARI) a(n)=nextprime(2^(10^n-1))-2^(10^n-1)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|