id:A152724 - OEIS Search Results

Search: id:A152724

Displaying 1-1 of 1 results found.

page 1

In binary, count of most frequent bit of n.

+0
2

1, 1, 2, 2, 2, 2, 3, 3, 2, 2, 3, 2, 3, 3, 4, 4, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 4, 3, 4, 4, 5, 5, 4, 4, 3, 4, 3, 3, 4, 4, 3, 3, 4, 3, 4, 4, 5, 4, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 6 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`Express n in binary; then a(n) is the larger of the number of 0s and the number of 1s.` `Example: a(17) = 3 because 17 in binary is 10001, which has 3 0s and 2 1s.`
	CROSSREFS	`a(n) = max( A000120(n), A023416(n) ).` `a(n) + A152723(n) = 1+floor(log[2](n)).` `Sequence in context: A029348 A070093 A058744 this_sequence A081743 A118377 A023516` `Adjacent sequences: A152721 A152722 A152723 this_sequence A152725 A152726 A152727`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Frank Ruskey (ruskey(AT)cs.uvic.ca), Dec 11 2008`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research