login
A131762
Number of 1s in the 1's complement of the 32-bit binary representation of n.
1
32, 31, 31, 30, 31, 30, 30, 29, 31, 30, 30, 29, 30, 29, 29, 28, 31, 30, 30, 29, 30, 29, 29, 28, 30, 29, 29, 28, 29, 28, 28, 27, 31, 30, 30, 29, 30, 29, 29, 28, 30, 29, 29, 28, 29, 28, 28, 27, 30, 29, 29, 28, 29, 28, 28, 27, 29, 28, 28, 27, 28, 27, 27, 26
OFFSET
0,1
COMMENTS
This sequence is finite with a total of 2^32 terms. - Andrew Howroyd, Jan 04 2020
LINKS
FORMULA
a(n) = 32 - (number of 1s in binary representation of n).
a(n) = 32 - A000120(n). - Andrew Howroyd, Jan 04 2020
EXAMPLE
a(7) = 32 - (number of 1s in 00000000000000000000000000000111) = 32 - 3 = 29.
PROG
(PARI) a(n)={32-hammingweight(n)} \\ Andrew Howroyd, Jan 04 2020
CROSSREFS
Cf. A000120.
Sequence in context: A070626 A022988 A023474 * A208129 A330574 A126271
KEYWORD
nonn,easy,fini
AUTHOR
Rachit Agrawal (rachit_agrawal(AT)daiict.ac.in), Oct 23 2007
EXTENSIONS
a(0) prepended and terms a(14) and beyond from Andrew Howroyd, Jan 04 2020
STATUS
approved