|
|
A160215
|
|
Primes congruent to 2^k+1 (mod 2^(k+1)), where k is any even integer >=0.
|
|
3
|
|
|
2, 5, 13, 17, 29, 37, 53, 61, 101, 109, 113, 149, 157, 173, 181, 193, 197, 229, 241, 257, 269, 277, 293, 317, 337, 349, 373, 389, 397, 401, 421, 433, 449, 461, 509, 541, 557, 577, 593, 613, 653, 661, 677, 701, 709, 733, 757, 769, 773, 797, 821, 829, 853, 877
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
If A(x) is the counting function of the terms not exceeding x, then A(x) grows similarly to Pi(x)/3, see A000720.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
fQ[n_] := Mod[ Flatten[ FactorInteger[n - 1]] [[2]], 2] == 0; Select[ Prime@ Range@ 155, fQ@# &] (* Robert G. Wilson v, May 31 2009 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|