login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098471 Least k such that Mersenne-prime(n)*2^k+1 is prime (A000668(n)*2^k+1). 1
1, 2, 8, 2, 12, 864, 4, 10, 8, 72, 18, 38, 2144, 178, 472, 974, 2200, 8128, 4580, 822, 3600, 4100 (list; graph; refs; listen; history; internal format)
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: A010466 A086396 A195844 * A074723 A175183 A189217

Adjacent sequences:  A098468 A098469 A098470 * A098472 A098473 A098474

KEYWORD

nonn

AUTHOR

Pierre CAMI (pierre-cami(AT)bbox.fr), Sep 09 2004

EXTENSIONS

a(18) - a(22) from Robert G. Wilson v Sep 13 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 19:23 EST 2012. Contains 205945 sequences.