This site is supported by donations to The OEIS Foundation.

 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 Lim_{x -> inf.} the number of terms < x in A160216/A160215 => 2. - Robert G. Wilson v, May 31 2009 LINKS FORMULA A000040 \ A160215. {prime(k) : A023506(k) is odd}. - R. J. Mathar, May 08 2009 MATHEMATICA fQ[n_] := Mod[ Flatten[ FactorInteger[n - 1]] [[2]], 2] == 1; Select[ Prime@ Range@ 90, fQ@# &] (* Robert G. Wilson v, May 31 2009 *) CROSSREFS Cf. A000040, A160215. Sequence in context: A179481 A131426 A080978 * A181516 A285015 A002145 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 | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.