cp's OEIS Frontend

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

%I A104733 #5 Sep 17 2013 13:21:39
%S A104733 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,
%T A104733 54,33,40,36,35,32,26,21,88,54,66,60,60,56,52,42,34,143,88,108,99,100,
%U A104733 96,91,84,68,55,232,143,176,162,165,160,156,147,136,110,89
%N A104733 Triangle T(n,k) = sum_{j=k..n} Fibonacci(n-j+1)*Fibonacci(k+1), read by rows, 0<=k<=n.
%F A104733 Matrix product of T(n,k) = sum_j A104762(n+1,j)*A104763(j+1,k), both interpreted as lower triangular square arrays.
%e A104733 The first few rows of the triangle are:
%e A104733 1;
%e A104733 2, 1;
%e A104733 4, 2, 2;
%e A104733 7, 4, 4, 3;
%e A104733 12, 7, 8, 6, 5;
%e A104733 20, 12, 14, 12, 10, 8
%Y A104733 Cf. A000071 (1st and 2nd column), A019274 (3rd column)
%K A104733 nonn,tabl
%O A104733 0,2
%A A104733 _Gary W. Adamson_, Mar 20 2005
%E A104733 Incorrect conjecture on row sums removed. _R. J. Mathar_, Sep 17 2013