OFFSET
0,9
FORMULA
T(n,k) = Sum_{j=0..n} (-k)^j * binomial(2*n,2*j).
T(0,k) = 1, T(1,k) = 1-k and T(n,k) = -2 * (k-1) * T(n-1,k) - (k+1)^2 * T(n-2,k) for n>1.
EXAMPLE
Square array begins:
1, 1, 1, 1, 1, 1, ...
1, 0, -1, -2, -3, -4, ...
1, -4, -7, -8, -7, -4, ...
1, 0, 23, 64, 117, 176, ...
1, 16, 17, -128, -527, -1264, ...
1, 0, -241, -512, 237, 3776, ...
MATHEMATICA
T[n_, 0] := 1; T[n_, k_] := Sum[(-k)^j * Binomial[2*n, 2*j], {j, 0, n}]; Table[T[k, n - k], {n, 0, 10}, {k, 0, n}] // Flatten (* Amiram Eldar, Sep 04 2020 *)
PROG
(PARI) {T(n, k) = sum(j=0, n, (-k)^j*binomial(2*n, 2*j))}
CROSSREFS
KEYWORD
sign,tabl
AUTHOR
Seiichi Manyama, Sep 04 2020
STATUS
approved