A115637 - OEIS

This site is supported by donations to The OEIS Foundation.

A115637

A divide-and-conquer sequence.

1, 0, 5, 4, 1, 0, 21, 20, 17, 16, 5, 4, 1, 0, 85, 84, 81, 80, 69, 68, 65, 64, 21, 20, 17, 16, 5, 4, 1, 0, 341, 340, 337, 336, 325, 324, 321, 320, 277, 276, 273, 272, 261, 260, 257, 256, 85, 84, 81, 80, 69, 68, 65, 64, 21, 20, 17, 16, 5, 4, 1, 0, 1365, 1364, 1361, 1360, 1349 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,3`
	COMMENTS	`Row sums of number triangle A115636. Partial sums of A115638.`
	LINKS	`R. Stephan, Divide-and-conquer generating functions. I. Elementary sequences`
	FORMULA	`G.f.: (1/(1-x))sum{k>=0, 4^kx^(2^(k+1)-2)/(1+x^(2^k))}; The g.f. G(x) satisfies G(x)-4(1+x)x^2G(x^2)=1/(1-x^2);`
	CROSSREFS	`Sequence in context: A129522 A133842 A199453 * A124602 A132707 A046575` `Adjacent sequences: A115634 A115635 A115636 * A115638 A115639 A115640`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Jan 27 2006`

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

Last modified February 17 16:49 EST 2012. Contains 206058 sequences.