|
|
A074204
|
|
Numbers k such that the number of 1's in the binary representation of k divides 2^k+1.
|
|
1
|
|
|
1, 2, 4, 7, 8, 11, 13, 16, 19, 21, 25, 32, 35, 37, 41, 49, 62, 64, 67, 69, 73, 81, 94, 97, 110, 118, 122, 128, 131, 133, 137, 145, 158, 161, 174, 182, 186, 193, 206, 214, 218, 230, 234, 242, 256, 259, 261, 265, 273, 286, 289, 302, 310, 314, 321, 334, 342, 346
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
MATHEMATICA
|
Select[Range[350], Divisible[2^#+1, DigitCount[#, 2, 1]]&] (* Harvey P. Dale, Feb 19 2011 *)
|
|
PROG
|
(PARI) isok(n) = !((2^n+1) % hammingweight(n)); \\ Michel Marcus, Nov 29 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|