|
%I #18 Dec 13 2019 09:48:11
%S 1,0,1,2,0,1,0,4,0,1,5,0,6,0,1,0,14,0,8,0,1,13,0,27,0,10,0,1,0,46,0,
%T 44,0,12,0,1,34,0,107,0,65,0,14,0,1,0,145,0,204,0,90,0,16,0,1,89,0,
%U 393,0,345,0,119,0,18,0,1,0,444,0,854,0,538,0,152,0,20,0,1
%N Triangle read by rows: A168561^2.
%C Left border, nonzero terms = odd indexed Fibonacci numbers: (1, 2, 5, 13, ...). Next column, nonzero terms = A030267: (1, 4, 14, 46, 145, ...). Row sums = A131322: (1, 1, 3, 5, 12, 23, 51, ...).
%C Riordan array (f(x),x*f(x)) where f(x) = (1-x^2)/(1-3*x^2+x^4). Aerated version of triangle in A188137. - _Philippe Deléham_, Jan 26 2012
%F A168561 squared, as an infinite lower triangular matrix.
%e First few rows of the triangle are:
%e 1;
%e 0, 1;
%e 2, 0, 1;
%e 0, 4, 0, 1;
%e 5, 0, 6, 0, 1;
%e 0, 14, 0, 8, 0, 1;
%e 13, 0, 27, 0, 10, 0, 1;
%e ...
%p F:= (n, k)-> coeff(combinat[fibonacci](n+1, x), x, k):
%p T:= (n, k)-> add(F(n, j)*F(j, k), j=0..n):
%p seq(seq(T(n, k), k=0..n), n=0..14); # _Alois P. Heinz_, Dec 12 2019
%Y Cf. A049310, A030267, A168561, A188137.
%K nonn,tabl
%O 0,4
%A _Gary W. Adamson_, Jun 28 2007
|
