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

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139354 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 min{e(n), o(n)}. 2
0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 2, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 0, 1, 0, 1, 1, 1, 1, 2, 0, 1, 0, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 2, 2, 2, 3, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,16

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: A178725 A257402 A230263 * A124762 A258590 A057558

Adjacent sequences:  A139351 A139352 A139353 * A139355 A139356 A139357

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 15 01:20 EST 2018. Contains 318141 sequences. (Running on oeis4.)