|
%I #7 Mar 30 2012 18:56:09
%S 1,1,1,1,3,1,1,5,5,1,1,7,10,7,1,1,9,17,17,9,1,1,11,26,34,26,11,1,1,13,
%T 37,60,60,37,13,1,1,15,50,97,120,97,50,15,1,1,17,65,147,217,217,147,
%U 65,17,1,1,19,82,212,364,434,364,212,82,19,1,1,21
%N Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; T(n,1)=T(n,n-1)=2n-1 for n >= 1; T(n,k)=T(n-1,k-1)+T(n-1,k) for 2<=k<=n-2, n >= 4.
%F T(n, k) = number of paths from (0, 0) to (n-k, k) in the directed graph having vertices (i, j) and edges (i, j)-to-(i+1, j) and (i, j)-to-(i, j+1) for i, j >= 0 and edges (i, j)-to-(i+1, j+1) for i=0, j >= 0 and for j=0, i >= 0.
%K nonn,tabl
%O 1,5
%A _Clark Kimberling_
|
