A216230 Square array T, read by antidiagonals: T(n,k) = 0 if n-k>=1 or if k-n>=2, T(0,0) = T(0,1) = 1, T(n,k) = T(n-1,k) + T(n,k-1).
1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 0
Examples
Square array begins: 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, ... 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, ... 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, ... 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, ... 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, ... 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, ... ...
Crossrefs
Formula
T(n,n) = T(n,n+1) = 1.
Sum_{k, 0<=k<=n} T(n-k, k) = 1.