This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A056791 Weight of binary expansion of n + length of binary expansion of n. 4
 1, 2, 3, 4, 4, 5, 5, 6, 5, 6, 6, 7, 6, 7, 7, 8, 6, 7, 7, 8, 7, 8, 8, 9, 7, 8, 8, 9, 8, 9, 9, 10, 7, 8, 8, 9, 8, 9, 9, 10, 8, 9, 9, 10, 9, 10, 10, 11, 8, 9, 9, 10, 9, 10, 10, 11, 9, 10, 10, 11, 10, 11, 11, 12, 8, 9, 9, 10, 9, 10, 10, 11, 9, 10, 10, 11, 10, 11, 11, 12, 9, 10, 10, 11, 10, 11, 11 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS R. Stephan, Some divide-and-conquer sequences ... R. Stephan, Table of generating functions FORMULA 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] CROSSREFS 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 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Sep 01 2000 EXTENSIONS 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 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 September 16 10:36 EDT 2019. Contains 327094 sequences. (Running on oeis4.)