id:A136429 - OEIS Search Results

Search: id:A136429

Displaying 1-1 of 1 results found.

page 1

a(n) = sum( F(k+1)^2 F(n-k+1)^2, k = 0..n ) where F(n) = Fibonacci number (A000045).

+0
1

1, 2, 9, 26, 84, 250, 747, 2182, 6323, 18132, 51624, 146004, 410677, 1149578, 3204477, 8899502, 24634620, 67990414, 187154271, 513939214, 1408246247, 3851081256, 10512259920, 28647203880, 77946605545, 211782868754 (list; graph; listen)

	OFFSET	`0,2`
	LINKS	`Emanuele Munarini (emanuele.munarini(AT)polimi.it), Apr 01 2008, Table of n, a(n) for n = 0..100`
	FORMULA	`G.f.: (1-x)^2/((1+x)^2(1-3x+x^2)^2). Recurrence: a(n+6) = 4 a(n+5) - 10 a(n+3) + 4 a(n+1) - a(n).`
	CROSSREFS	`Sequence in context: A083383 A082289 A014150 this_sequence A091469 A125670 A008910` `Adjacent sequences: A136426 A136427 A136428 this_sequence A136430 A136431 A136432`
	KEYWORD	`easy,nonn`
	AUTHOR	`Emanuele Munarini (emanuele.munarini(AT)polimi.it), Apr 01 2008`

page 1

Search completed in 0.005 seconds

Last modified July 23 10:48 EDT 2008. Contains 142285 sequences.

AT&T Labs Research