id:A139371 - OEIS Search Results

Search: id:A139371

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, 2, 3, 6, 8, 9, 10, 11, 12, 14, 15, 18, 24, 26, 27, 30, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 50, 51, 54, 56, 57, 58, 59, 60, 62, 63, 66, 72, 74, 75, 78, 90, 96, 98, 99, 102, 104, 105, 106, 107, 108, 110, 111, 114, 120, 122, 123, 126 (list; graph; listen)

	OFFSET	`1,2`
	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: A140265 A127293 A138343 this_sequence A079338 A047405 A084090` `Adjacent sequences: A139368 A139369 A139370 this_sequence A139372 A139373 A139374`
	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 November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research