A199238 n mod (number of ones in binary representation of n).

0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 2, 3, 0, 1, 0, 1, 0, 0, 1, 3, 0, 1, 2, 3, 1, 1, 2, 1, 0, 1, 0, 2, 0, 1, 2, 3, 0, 2, 0, 3, 2, 1, 2, 2, 0, 1, 2, 3, 1, 1, 2, 0, 2, 1, 2, 4, 0, 1, 2, 3, 0, 1, 0, 1, 0, 0, 1, 3, 0, 1, 2, 3, 1, 1, 2, 4, 0, 0, 1, 3, 0, 1, 2

Offset

1,11

Comments

a(A049445(n)) = 0;

a(n) = n - A161764(n);

a(A199262(n)) = n and a(m) <> n for m < A199262(n).

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Index entries for sequences related to binary expansion of n

Mathematica

Mod[#, DigitCount[#, 2, 1]]&/@Range[90] (* Harvey P. Dale, Nov 08 2011 *)

Prog

(Haskell)
a199238 n = a199238_list !! (n-1)
a199238_list = zipWith mod [1..] $ tail a000120_list
(PARI) A199238(n)=n%norml2(binary(n))  \\ M. F. Hasler, Oct 09 2012

Crossrefs

Cf. A000120, A070635, A049445, A161764, A199262.

Sequence in context: A336937 A069584 A069585 * A346698 A352515 A181347

Adjacent sequences: A199235 A199236 A199237 * A199239 A199240 A199241

Keyword

nonn

Author

Reinhard Zumkeller, Nov 04 2011

Status

approved