login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A152724 In binary, count of most frequent bit of n. 1
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; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

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: A058744 A185617 A196046 * A081743 A118377 A023516

Adjacent sequences:  A152721 A152722 A152723 * A152725 A152726 A152727

KEYWORD

base,easy,nonn

AUTHOR

Frank Ruskey (ruskey(AT)cs.uvic.ca), Dec 11 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 00:47 EST 2012. Contains 205567 sequences.