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

 

Logo

110 people attended OEIS-50 (videos, suggestions); annual fundraising drive to start soon (donate); editors, please edit! (stack is over 300), your editing is more valuable than any donation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057025 Smallest prime of form (2n+1)*2^m+1 for some m. 2
2, 7, 11, 29, 19, 23, 53, 31, 137, 1217, 43, 47, 101, 109, 59, 7937, 67, 71, 149, 79, 83, 173, 181 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

next term a(23) = 47*2^583+1 > 10^177. Sequence then continues: 197, 103, 107, 881, 229, 1889, 977, 127, 131, 269, 139, 569, 293, 151, 617, 317, 163, 167, 1361, 349, 179, 23297, 373, 191, 389, 199, 809, ...

If no such prime exists for any m then 2n+1 is called a Sierpinski number. One could use a(n) = 0 for these cases. E.g., a(39278) = 0 because 78557 is a Sierpinski number. For the corresponding numbers m see A046067(n+1), n >= 0, where -1 entries corresponds to a(n) = 0. See also the Sierpinski links there. - Wolfdieter Lang, Feb 07 2013.

LINKS

Table of n, a(n) for n=0..22.

Index entries for sequences of n such that k*2^n-1 (or k*2^n+1) is prime

EXAMPLE

a(5)=23 because 2*5+1=11 and smallest prime of the form 11*2^m+1 is 23 (since 11+1=12 is not prime)

CROSSREFS

Cf. A032373, A057023, A057026, A046067.

Sequence in context: A024481 A024591 A073602 * A055469 A228076 A123151

Adjacent sequences:  A057022 A057023 A057024 * A057026 A057027 A057028

KEYWORD

nonn

AUTHOR

Henry Bottomley, Jul 24 2000

STATUS

approved

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

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

Last modified October 30 10:33 EDT 2014. Contains 248797 sequences.