0,2

Table of n, a(n) for n=0..86.

R. Stephan, Some divide-and-conquer sequences ...

R. Stephan, Table of generating functions

Index to sequences related to the complexity of n

a(n) = a((n - n mod 2) / (2 - n mod 2)) + 1 for n>0, a(0)=1. - Reinhard Zumkeller, Jul 29 2002

a(2n) = a(n)+1, a(2n+1) = a(n)+2. G.f.: 1 + 1/(1-x) * sum(k>=0, (2t+t^2)/(1+t), t=x^2^k). For n>0, a(n) = 2*A000120(n) + A080791(n) = A000120(n) + A029837(n). - Ralf Stephan, Jun 14 2003

a(n)=sum_{i>=0} 2^b(i) where n=sum_{i>=0} b(i)*2^e(i)is the representation of n. [From Juri-Stepan Gerasimov, Jun 06 2010]

Equals A056792 + 1.

Equals A014701 + 2. Cf. A061313, A037861.

Sequence in context: A172006 A172005 A200247 * A218767 A318994 A261101

Adjacent sequences: A056788 A056789 A056790 * A056792 A056793 A056794

nonn,easy

N. J. A. Sloane, Sep 01 2000

12 = 1100 in binary, so a(12)=2+4=6.

More terms from James A. Sellers, Sep 06 2000 and from David W. Wilson, Sep 07, 2000

approved