id:A033265 - OEIS Search Results

Search: id:A033265

Displaying 1-1 of 1 results found.

page 1

Number of i such that d(i)<=d(i-1), where Sum{d(i)*2^i: i=0,1,...,m} is base 2 representation of n.

+0
1

0, 1, 1, 2, 1, 2, 2, 3, 2, 2, 2, 3, 2, 3, 3, 4, 3, 3, 3, 3, 2, 3, 3, 4, 3, 3, 3, 4, 3, 4, 4, 5, 4, 4, 4, 4, 3, 4, 4, 4, 3, 3, 3, 4, 3, 4, 4, 5, 4, 4, 4, 4, 3, 4, 4, 5, 4, 4, 4, 5, 4, 5, 5, 6, 5, 5, 5, 5, 4, 5, 5, 5, 4, 4, 4, 5, 4, 5, 5, 5, 4, 4, 4, 4, 3, 4, 4, 5, 4, 4 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`R. Stephan, Some divide-and-conquer sequences ...` `R. Stephan, Table of generating functions`
	FORMULA	`a(0) = 0, a(2n) = a(n) + 1, a(2n+1) = a(n) + [n odd]. a(n) = A014081(n) + A023416(n). G.f. 1/(1-x) * sum(k>=0, (t^2+t^3+t^4)/((1+t)*(1+t^2)), t=x^2^k). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 05 2003`
	CROSSREFS	`Adjacent sequences: A033262 A033263 A033264 this_sequence A033266 A033267 A033268` `Sequence in context: A109129 A064122 A057526 this_sequence A096004 A071068 A137735`
	KEYWORD	`nonn,base`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research