|
|
A074202
|
|
Numbers k such that the number of 1's in the binary expansion of k divides 2^k-1.
|
|
3
|
|
|
1, 2, 4, 8, 14, 16, 22, 26, 28, 32, 38, 42, 44, 50, 52, 56, 64, 70, 74, 76, 82, 84, 88, 98, 100, 104, 112, 124, 128, 134, 138, 140, 146, 148, 152, 162, 164, 168, 176, 188, 194, 196, 200, 208, 220, 224, 236, 244, 248, 256, 262, 266, 268, 274, 276, 280, 290, 292
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Odd terms (1, 351, 375, ...) are in A074203.
|
|
LINKS
|
|
|
MATHEMATICA
|
Select[Range[300], (d = DigitCount[#, 2, 1]) == 1 || PowerMod[2, #, d] == 1 &] (* Amiram Eldar, Jul 30 2020 *)
|
|
PROG
|
(PARI) isok(n) = !((2^n-1) % hammingweight(n)); \\ Michel Marcus, Nov 29 2013
(Python)
from itertools import count, islice
def A074202_gen(startvalue=1): # generator of terms >= startvalue
return filter(lambda n:not ((1<<n)-1) % n.bit_count(), count(max(startvalue, 1)))
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|