|
%I #8 Mar 12 2014 16:37:17
%S 0,0,2,1,0,3,2,0,5,5,4,1,0,8,8,7,3,0,13,13,13,12,7,1,0,21,21,21,20,14,
%T 4,0,34,34,34,34,33,26,11,1,0,55,55,55,55,54,46,25,5,0,89,89,89,89,89,
%U 88,79,51,16,1,0
%N Triangle t(n,k)= sum_{m=1..floor(n/2-k)} binomial(n-m-k,m+k), -floor(n/2) <= k <= floor(n/2), read by rows.
%C Row sums are 0, 0, 3, 5, 15, 26, 59, 101, 207, 350, 680,...
%C The first column is essentially A000045, and the other columns also join the Fibonacci sequence after some transient initial terms.
%e 0;
%e 0;
%e 2, 1, 0;
%e 3, 2, 0;
%e 5, 5, 4, 1, 0;
%e 8, 8, 7, 3, 0;
%e 13, 13, 13, 12, 7, 1, 0;
%e 21, 21, 21, 20, 14, 4, 0;
%e 34, 34, 34, 34, 33, 26, 11, 1, 0;
%e 55, 55, 55, 55, 54, 46, 25, 5, 0;
%e 89, 89, 89, 89, 89, 88, 79, 51, 16, 1, 0;
%t w[n_, m_, k_] = Binomial[n - (m + k), m + k];
%t t[n_, k_] := Sum[w[n, m, k], {m, 1, Floor[n/2 - k]}];
%t Table[Table[t[n, k], {k, -Floor[n/2], Floor[n/2]}], {n, 0, 10}];
%t Flatten[%]
%Y Cf. A000045
%K nonn,tabf
%O 0,3
%A _Roger L. Bagula_, Dec 10 2010
|
