A334076 a(n) = bitwise NOR of n and 2n.
0, 0, 1, 0, 3, 0, 1, 0, 7, 4, 1, 0, 3, 0, 1, 0, 15, 12, 9, 8, 3, 0, 1, 0, 7, 4, 1, 0, 3, 0, 1, 0, 31, 28, 25, 24, 19, 16, 17, 16, 7, 4, 1, 0, 3, 0, 1, 0, 15, 12, 9, 8, 3, 0, 1, 0, 7, 4, 1, 0, 3, 0, 1, 0, 63, 60, 57, 56, 51, 48, 49, 48, 39, 36, 33, 32, 35, 32, 33
Offset: 0
Links
- Alois P. Heinz, Table of n, a(n) for n = 0..32767
- Wikipedia, Bitwise operation
Programs
-
Maple
a:= n-> Bits[Nor](n, 2*n): seq(a(n), n=0..127);
-
PARI
a(n) = my(x=bitor(n, 2*n)); bitneg(x, #binary(x)); \\ Michel Marcus, Apr 14 2020
-
Python
def A334076(n): m = n|(2*n) return 0 if n == 0 else 2**(len(bin(m))-2)-1-m # Chai Wah Wu, Apr 14 2020
Comments