id:A139373 - OEIS Search Results

Search: id:A139373

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
10

1, 4, 5, 7, 13, 16, 17, 19, 20, 21, 22, 23, 25, 28, 29, 31, 37, 49, 52, 53, 55, 61, 64, 65, 67, 68, 69, 70, 71, 73, 76, 77, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 97, 100, 101, 103, 109, 112, 113, 115, 116, 117, 118, 119, 121, 124 (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-A139372.` `Adjacent sequences: A139370 A139371 A139372 this_sequence A139374 A139375 A139376` `Sequence in context: A138920 A048224 A064237 this_sequence A069575 A072215 A106170`
	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 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research