A152723 In binary, count of least frequent bit of n.

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

Offset

1,9

Comments

Express n in binary, then a(n) is the smaller of the number of 0's and the number of 1's;

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

Index entries for sequences related to binary expansion of n

Example

a(35) = 3, since 35 in binary is 100011.

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
(PARI) a(n) = my(x=hammingweight(n)); min(x, #binary(n) - x); \\ Michel Marcus, Mar 30 2020

Crossrefs

Cf. A000120, A023416, A070939, A152724.

Cf. A092431 (positions of records).

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