id:A139372 - OEIS Search Results

Search: id:A139372

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 lists n such that e(n) >= o(n).

+0
2

0, 1, 3, 4, 5, 6, 7, 9, 12, 13, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 33, 36, 37, 39, 45, 48, 49, 51, 52, 53, 54, 55, 57, 60, 61, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`e(n)+o(n) = A000120(n), the binary weight of n. For e(n) = o(n) see A039004.`
	PROGRAM	`See link in A139351 for Fortran program.`
	CROSSREFS	`Cf. A000120, A139351-A139355, A039004, A139370-A139373.` `Sequence in context: A161346 A096515 A100586 this_sequence A128659 A022555 A047308` `Adjacent sequences: A139369 A139370 A139371 this_sequence A139373 A139374 A139375`
	KEYWORD	`nonn`
	AUTHOR	`Nadia Heninger (nadiah(AT)cs.princeton.edu) and N. J. A. Sloane (njas(AT)research.att.com), Jun 07 2008`

page 1

Search completed in 0.002 seconds

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research