id:A139355 - OEIS Search Results

Search: id:A139355

Displaying 1-1 of 1 results found.

page 1

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 max{e(n), o(n)}.

+0
10

0, 1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 3, 2, 3, 1, 2, 2, 2, 2, 3, 2, 3, 1, 1, 2, 2, 1, 2, 2, 2, 2, 2, 3, 3, 2, 2, 3, 3, 1, 2, 2, 2, 2, 3, 2, 3, 2, 2, 3, 3, 2, 3, 3, 3, 1, 2, 1, 2, 2, 3, 2, 3, 1, 2, 2, 2, 2, 3, 2, 3, 2, 3, 2, 3, 3, 4, 3, 4, 2, 3, 2, 3, 3, 4, 3, 4, 1, 2, 2 (list; graph; listen)

	OFFSET	`0,6`
	COMMENT	`e(n)+o(n) = A000120(n), the binary weight of n.`
	EXAMPLE	`If n = 43 = 2^0+2^2+2^3+2^5, e(43)=1, o(43)=3.`
	PROGRAM	`See link in A139351 for Fortran program.`
	CROSSREFS	`Cf. A000120, A139351-A139354, A039004, A139370-A139373.` `Adjacent sequences: A139352 A139353 A139354 this_sequence A139356 A139357 A139358` `Sequence in context: A049236 A094840 A035218 this_sequence A039736 A093921 A140192`
	KEYWORD	`nonn`
	AUTHOR	`Nadia Heninger (nadiah(AT)cs.princeton.edu) and njas, Jun 07 2008`

page 1

Search completed in 0.002 seconds

Last modified October 6 16:13 EDT 2008. Contains 144667 sequences.

AT&T Labs Research