A033265 - OEIS

This site is supported by donations to The OEIS Foundation.

A033265

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, 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; refs; listen; history; internal format)

	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	`Sequence in context: A188550 A064122 A057526 * A096004 A193495 A071068` `Adjacent sequences: A033262 A033263 A033264 * A033266 A033267 A033268`
	KEYWORD	`nonn,base`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 15:50 EST 2012. Contains 205931 sequences.