id:A103433 - OEIS Search Results

Search: id:A103433

Displaying 1-1 of 1 results found.

page 1

Sum[i=1..n, Fibonacci(2i-1)^2 ].

+0
5

0, 1, 5, 30, 199, 1355, 9276, 63565, 435665, 2986074, 20466835, 140281751, 961505400, 6590256025, 45170286749, 309601751190, 2122041971551, 14544692049635, 99690802375860, 683290924581349, 4683345669693545 (list; graph; listen)

	OFFSET	`0,3`
	REFERENCES	`A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, id. 234.`
	FORMULA	`G.f.: x(1-4x+x^2) / [(1-7x+x^2)(1-x)^2 ].` `(1/5) [Fibonacci(4n) + 2n ].`
	CROSSREFS	`Partial sums of A081068. Bisection of A077916.` `Sequence in context: A098663 A158828 A034164 this_sequence A081015 A090139 A107265` `Adjacent sequences: A103430 A103431 A103432 this_sequence A103434 A103435 A103436`
	KEYWORD	`nonn,easy`
	AUTHOR	`Ralf Stephan, Feb 08 2005`

page 1

Search completed in 0.005 seconds

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.

AT&T Labs Research