This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A152723 In binary, count of least frequent bit of n. 2
 0, 1, 0, 1, 1, 1, 0, 1, 2, 2, 1, 2, 1, 1, 0, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 1, 1, 0, 1, 2, 2, 3, 2, 3, 3, 2, 2, 3, 3, 2, 3, 2, 2, 1, 2, 3, 3, 2, 3, 2, 2, 1, 3, 2, 2, 1, 2, 1, 1, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 COMMENTS Express n in binary, then a(n) is the smaller of the number of 0s and the number of 1s; a(n) = min( A000120(n), A023416(n)); a(n) + A152724(n) = 1+floor(log[2](n)). a(n) = A070939(n) - A152724(n). - Reinhard Zumkeller, Mar 31 2015 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 EXAMPLE n = 35 is the smallest number for which a(n) = 3, since 35 in binary is 100011, which is the smallest binary number with 3 0s and 3 1s.~ MATHEMATICA Table[Min[DigitCount[n, 2, 1], DigitCount[n, 2, 0]], {n, 70}] (* Harvey P. Dale, May 09 2012 *) PROG (Haskell) a152723 n = min (a000120 n) (a023416 n) -- Reinhard Zumkeller, Mar 31 2015 CROSSREFS Cf. A000120, A023416, A070939, A152724. Sequence in context: A085906 A221649 A090406 * A237497 A281191 A324496 Adjacent sequences:  A152720 A152721 A152722 * A152724 A152725 A152726 KEYWORD base,easy,nonn AUTHOR Frank Ruskey, Dec 11 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 25 13:50 EDT 2019. Contains 326324 sequences. (Running on oeis4.)