id:A115716 - OEIS Search Results

Search: id:A115716

Displaying 1-1 of 1 results found.

page 1

A divide-and-conquer sequence.

+0
3

1, 1, 3, 1, 3, 1, 11, 1, 3, 1, 11, 1, 3, 1, 43, 1, 3, 1, 11, 1, 3, 1, 43, 1, 3, 1, 11, 1, 3, 1, 171, 1, 3, 1, 11, 1, 3, 1, 43, 1, 3, 1, 11, 1, 3, 1, 171, 1, 3, 1, 11, 1, 3, 1, 43, 1, 3, 1, 11, 1, 3, 1, 683, 1, 3, 1, 11, 1, 3, 1, 43, 1, 3, 1, 11, 1, 3, 1, 171, 1, 3, 1, 11, 1, 3, 1, 43, 1, 3, 1, 11, 1 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`The g.f. G(x) satisfies G(x)-4x^2*G(x)=(1+2x)/(1+x) Partial sums are A032925. Row sums of number triangle A115717.`
	LINKS	`R. Stephan, Divide-and-conquer generating functions. I. Elementary sequences`
	FORMULA	`G.f.: sum{k>=0, ((4^k-0^k)/2)*x^(2^(k+1)-2)/(1+x^(2^k))}; a(n)=A007583(A091090(n)).`
	CROSSREFS	`Cf. A007583, A081294.` `Sequence in context: A072860 A068503 A073575 this_sequence A079412 A099906 A047787` `Adjacent sequences: A115713 A115714 A115715 this_sequence A115717 A115718 A115719`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Jan 29 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research