id:A056791 - OEIS Search Results

Search: id:A056791

Displaying 1-1 of 1 results found.

page 1

Weight of binary expansion of n + length of binary expansion of n.

+0
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; listen)

	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 (reinhard.zumkeller(AT)lhsystems.com), 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 (ralf(AT)ark.in-berlin.de), Jun 14 2003`
	CROSSREFS	`A056792 + 1.` `Equals A014701 + 2. Cf. A061313, A037861.` `Sequence in context: A049839 A130233 A131234 this_sequence A027434 A071940 A085883` `Adjacent sequences: A056788 A056789 A056790 this_sequence A056792 A056793 A056794`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas, Sep 01 2000`
	EXTENSIONS	`12 = 1100 in binary, so a(12)=2+4=6.` `More terms from James A. Sellers (sellersj(AT)math.psu.edu), Sep 06 2000 and from David W. Wilson (davidwwilson(AT)comcast.net), Sep 07, 2000`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research