

A104733


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


0



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
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


LINKS

Table of n, a(n) for n=0..65.


FORMULA

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


EXAMPLE

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)
Sequence in context: A300586 A094571 A316477 * A201703 A153281 A338654
Adjacent sequences: A104730 A104731 A104732 * A104734 A104735 A104736


KEYWORD

nonn,tabl


AUTHOR

Gary W. Adamson, Mar 20 2005


EXTENSIONS

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


STATUS

approved



