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!)
A160216 Primes congruent to 2^k+1 (mod 2^(k+1)), where k is any odd integer >=1. 4
3, 7, 11, 19, 23, 31, 41, 43, 47, 59, 67, 71, 73, 79, 83, 89, 97, 103, 107, 127, 131, 137, 139, 151, 163, 167, 179, 191, 199, 211, 223, 227, 233, 239, 251, 263, 271, 281, 283, 307, 311, 313, 331, 347, 353, 359, 367, 379, 383, 409, 419, 431, 439, 443, 457, 463 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The Lim (x -> inf.) the number of terms < x in A160216/A160215 => 2. [From Robert G. Wilson v, May 31 2009]

LINKS

Table of n, a(n) for n=1..56.

FORMULA

A000040 \ A160215.

{prime(k) : A023506(k) is odd} - [R. J. Mathar, Mary 08 2009]

MATHEMATICA

fQ[n_] := Mod[ Flatten[ FactorInteger[n - 1]] [[2]], 2] == 1; Select[ Prime@ Range@ 90, fQ@# &] [From Robert G. Wilson v, May 31 2009]

CROSSREFS

A000040, A160215

Sequence in context: A179481 A131426 A080978 * A181516 A002145 A092109

Adjacent sequences:  A160213 A160214 A160215 * A160217 A160218 A160219

KEYWORD

nonn

AUTHOR

Vladimir Shevelev, May 04 2009

EXTENSIONS

Edited by R. J. Mathar, May 08 2009

More terms from Robert G. Wilson v, May 31 2009

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 09:35 EDT 2014. Contains 248797 sequences.