login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139353 Let the binary expansion of n be n = Sum_{k} 2^{r_k}, let e(n) be the number of r_k's that are even, o(n) the number that are odd; sequence gives e(n)*o(n). 1
0, 0, 0, 1, 0, 0, 1, 2, 0, 1, 0, 2, 1, 2, 2, 4, 0, 0, 1, 2, 0, 0, 2, 3, 1, 2, 2, 4, 2, 3, 4, 6, 0, 1, 0, 2, 1, 2, 2, 4, 0, 2, 0, 3, 2, 4, 3, 6, 1, 2, 2, 4, 2, 3, 4, 6, 2, 4, 3, 6, 4, 6, 6, 9, 0, 0, 1, 2, 0, 0, 2, 3, 1, 2, 2, 4, 2, 3, 4, 6, 0, 0, 2, 3, 0, 0, 3, 4, 2, 3, 4, 6, 3, 4, 6, 8, 1, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,8

COMMENTS

e(n)+o(n) = A000120(n), the binary weight of n.

LINKS

Table of n, a(n) for n=0..98.

EXAMPLE

If n = 43 = 2^0+2^2+2^3+2^5, e(43)=1, o(43)=3.

PROG

See link in A139351 for Fortran program.

CROSSREFS

Cf. A000120, A139351-A139355, A039004, A139370-A139373.

Sequence in context: A259965 A117054 A036579 * A029397 A129447 A125079

Adjacent sequences:  A139350 A139351 A139352 * A139354 A139355 A139356

KEYWORD

nonn

AUTHOR

Nadia Heninger and N. J. A. Sloane, Jun 07 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 18 21:04 EST 2018. Contains 317331 sequences. (Running on oeis4.)