OFFSET
1,5
FORMULA
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 if both i and j are even.
Equals 2*A007318 - A034851 (i.e. twice Pascal's triangle - the Losanitch triangle). - Gary W. Adamson, Dec 31 2007
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
STATUS
approved