|
Search: id:A098471
|
|
|
| A098471 |
|
Least k such that Mersenne-prime(n)*2^k+1 is prime (A000668(n)*2^k+1). |
|
+0
2
|
|
| 1, 2, 8, 2, 12, 864, 4, 10, 8, 72, 18, 38, 2144, 178, 472, 974, 2200, 8128, 4580, 822, 3600, 4100
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
MATHEMATICA
|
mexp = {the list in A000043}; f[n_] := Block[{k = 1, mp = 2^mexp[[n]] - 1}, While[ !PrimeQ[mp*2^k + 1] && k < 10000, k++ ]; If[k == 10000, 0, k]]; Do[ Print[ f[n]], {n, 22}] (from Robert G. Wilson v Sep 13 2004)
|
|
CROSSREFS
|
Cf. A098472.
Sequence in context: A010698 A010466 A086396 this_sequence A074723 A063077 A085192
Adjacent sequences: A098468 A098469 A098470 this_sequence A098472 A098473 A098474
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Pierre CAMI (pierrecami(AT)tele2.fr), Sep 09 2004
|
|
EXTENSIONS
|
a(18) - a(22) from Robert G. Wilson v Sep 13 2004
|
|
|
Search completed in 0.002 seconds
|
