|
| |
|
|
A126715
|
|
a(n) = smallest odd prime p such that p*2^n - 1 is prime.
|
|
4
| |
|
|
3, 3, 3, 3, 3, 7, 3, 3, 5, 7, 5, 3, 5, 31, 5, 79, 17, 7, 3, 61, 17, 7, 83, 13, 83, 61, 11, 193, 83, 7, 521, 43, 5, 31, 3, 31, 17, 31, 3, 61, 107, 19, 53, 3, 557, 7, 23, 31, 5, 19, 11, 1033, 89, 307, 5, 3, 563, 79, 83, 733, 17, 79, 53, 61, 3, 67, 257, 43, 179, 139, 47, 73, 5, 421, 113
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| By Xylouris' version of Linnik's theorem, a(n) << 2^(5.2n). [Charles R Greathouse IV, Dec 28 2011]
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n = 0..2500
|
|
|
MATHEMATICA
| f[n_] := Block[{k = 2}, While[ !PrimeQ[ Prime[k]*2^n - 1], k++ ]; Prime@k]; Table[f@n, {n, 0, 74}] (* Robert G. Wilson v *)
|
|
|
CROSSREFS
| Sequence in context: A105591 A130497 A178154 * A158805 A163469 A105121
Adjacent sequences: A126712 A126713 A126714 * A126716 A126717 A126718
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Pierre CAMI (pierre-cami(AT)bbox.fr), Feb 13 2007
|
|
|
EXTENSIONS
| More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 16 2007
Entries checked by N. J. A. Sloane (njas(AT)research.att.com), Mar 02 2007 and some errors corrected.
|
| |
|
|
