A104733 Triangle T(n,k) = sum_{j=k..n} Fibonacci(n-j+1)*Fibonacci(k+1), read by rows, 0<=k<=n.

1, 2, 1, 4, 2, 2, 7, 4, 4, 3, 12, 7, 8, 6, 5, 20, 12, 14, 12, 10, 8, 33, 20, 24, 21, 20, 16, 13, 54, 33, 40, 36, 35, 32, 26, 21, 88, 54, 66, 60, 60, 56, 52, 42, 34, 143, 88, 108, 99, 100, 96, 91, 84, 68, 55, 232, 143, 176, 162, 165, 160, 156, 147, 136, 110, 89

Offset: 0

Author

Gary W. Adamson, Mar 20 2005

Keywords

• nonn
• tabl

Examples

			The first few rows of the triangle are:
1;
2, 1;
4, 2, 2;
7, 4, 4, 3;
12, 7, 8, 6, 5;
20, 12, 14, 12, 10, 8
		

Crossrefs

Cf. A000071 (1st and 2nd column), A019274 (3rd column)

Formula

Matrix product of T(n,k) = sum_j A104762(n+1,j)*A104763(j+1,k), both interpreted as lower triangular square arrays.

Extensions

Incorrect conjecture on row sums removed. R. J. Mathar, Sep 17 2013