|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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).
|
|
EXAMPLE
|
a(7) = 32 - (number of 1s in 00000000000000000000000000000111) = 32 - 3 = 29.
|
|
PROG
|
|
|
CROSSREFS
|
|
|
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
|
|
|
|