Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)

Revision History for A098471

(Underlined text is an addition; strikethrough text is a deletion.)

Showing all changes.
A098471 Least k such that Mersenne-prime(n)*2^k+1 is prime (A000668(n)*2^k+1).
(history; published version)
#6 by Jon E. Schoenfield at Sat Mar 21 06:11:14 EDT 2015
STATUS

editing

approved

#5 by Jon E. Schoenfield at Sat Mar 21 06:11:12 EDT 2015
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) *)

EXTENSIONS

a(18) - )-a(22) from _Robert G. Wilson v _, Sep 13 2004

STATUS

approved

editing

#4 by Russ Cox at Sat Mar 31 13:22:03 EDT 2012
AUTHOR

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

Discussion
Sat Mar 31 13:22
OEIS Server: https://oeis.org/edit/global/885
#3 by Charles R Greathouse IV at Thu Dec 01 11:14:14 EST 2011
AUTHOR

Pierre CAMI (pierrecamipierre-cami(AT)tele2bbox.fr), Sep 09 2004

Discussion
Thu Dec 01 11:14
OEIS Server: https://oeis.org/edit/global/101
#2 by N. J. A. Sloane at Sun Feb 20 03:00:00 EST 2005
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 RGWvv Sep 13 2004)

KEYWORD

nonn,new

nonn

EXTENSIONS

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

#1 by N. J. A. Sloane at Wed Sep 22 03:00:00 EDT 2004
NAME

Least k such that Mersenne-prime(n)*2^k+1 is prime (A000668(n)*2^k+1).

DATA

1, 2, 8, 2, 12, 864, 4, 10, 8, 72, 18, 38, 2144, 178, 472, 974, 2200, 8128, 4580, 822, 3600, 4100

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 RGWv Sep 13 2004)

CROSSREFS

Cf. A098472.

KEYWORD

nonn,new

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Sep 09 2004

EXTENSIONS

a(18) - a(22) from RGWv Sep 13 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 19:26 EDT 2024. Contains 375273 sequences. (Running on oeis4.)