login
A265918
a(n) = A070939(n) mod A000120(n), where A070939(n) is the binary length of n and A000120(n) is the binary weight of n.
2
0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 2, 1, 2, 2, 1, 1, 2, 2, 1, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 2, 2, 1, 0, 0, 0, 2, 0, 2, 2, 1, 0, 2, 2, 1, 2, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 3, 3, 2, 1, 1, 1, 3, 1, 3, 3
OFFSET
1,19
LINKS
MATHEMATICA
Table[Mod[IntegerLength[n, 2], Total@ IntegerDigits[n, 2]], {n, 120}] (* Michael De Vlieger, Dec 21 2015 *)
PROG
(Python)
for n in range(1, 88): print str((len(bin(n))-2) % bin(n).count('1'))+', ',
(PARI) a(n) = #binary(n) % hammingweight(n); \\ Michel Marcus, Dec 19 2015
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Alex Ratushnyak, Dec 18 2015
STATUS
approved