A229745 a(n) = wt(n+wt(n))-wt(n), where wt(n) is the binary weight of n, A000120(n).

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

Offset

0,14

Comments

For any positive or negative integer m, there are infinitely many positive integers n such that a(n) = m. [Stolarsky]

Links

N. J. A. Sloane, Table of n, a(n) for n = 0..10000

Kenneth B. Stolarsky, The sum of a digitaddition series, Proc. Amer. Math. Soc. 59 (1976), no. 1, 1--5. MR0409340 (53 #13099)

Mathematica

f[n_] := DigitCount[n, 2, 1]; Table[f[n + f@ n] - f@ n, {n, 120}] (* Michael De Vlieger, Apr 04 2015 *)

Prog

(PARI) a(n) = hammingweight(n+hammingweight(n)) - hammingweight(n); \\ Michel Marcus, Apr 04 2015

Crossrefs

Cf. A000120, A010062.

Sequence in context: A269242 A321759 A076882 * A339366 A016397 A238450

Adjacent sequences: A229742 A229743 A229744 * A229746 A229747 A229748

Keyword

sign

Author

N. J. A. Sloane, Oct 08 2013

Status

approved