Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A160216
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A160216 Primes congruent to 2^k+1 (mod 2^(k+1)), where k is any odd integer >=1. +0
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; listen)
OFFSET

1,1

COMMENT

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

FORMULA

A000040 \ A160215.

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

MATHEMATICA

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

CROSSREFS

A000040, A160215

Sequence in context: A085760 A131426 A080978 this_sequence A002145 A092109 A117991

Adjacent sequences: A160213 A160214 A160215 this_sequence A160217 A160218 A160219

KEYWORD

nonn

AUTHOR

Vladimir Shevelev (shevelev(AT)bgu.ac.il), May 04 2009

EXTENSIONS

Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 08 2009

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), May 31 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research