|
|
A216668
|
|
Smallest integer b > 1 such that for all primes p <= prime(n), (b+1)^p - b^p is prime if and only if 2^p-1 is prime.
|
|
1
|
|
|
2, 2, 2, 296, 296, 369719, 457578, 43410300320, 43410300320, 43410300320, 288975248496
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|