Alternating bit sum for n: replace 2^k with (-1)^k in binary expansion of n.
A065359
Alternating bit sum for n: replace 2^k with (-1)^k in binary expansion of n.
Terms
- a(0) =0a(1) =1a(2) =-1a(3) =0a(4) =1a(5) =2a(6) =0a(7) =1a(8) =-1a(9) =0a(10) =-2a(11) =-1a(12) =0a(13) =1a(14) =-1a(15) =0a(16) =1a(17) =2a(18) =0a(19) =1a(20) =2a(21) =3a(22) =1a(23) =2a(24) =0a(25) =1a(26) =-1a(27) =0a(28) =1a(29) =2
External references
- oeis: A065359