OFFSET
0,3
LINKS
Seiichi Manyama, Antidiagonals n = 0..139, flattened
FORMULA
G.f. A_k(x) of column k satisfies A_k(x) = 1 + x * A_k(x)^k * (2 + A_k(x)).
T(n,k) = Sum_{j=0..n} 2^(n-j) * binomial(n,j) * binomial(k*n+j+1,n)/(k*n+j+1).
T(n,k) = (1/(k*n+1)) * Sum_{j=0..n} 2^j * binomial(k*n+1,j) * binomial((k+1)*n-j,n-j).
T(n,k) = (1/n) * Sum_{j=0..n-1} (-2)^j * 3^(n-j) * binomial(n,j) * binomial((k+1)*n-j,n-1-j) for n > 0. - Seiichi Manyama, Aug 10 2023
EXAMPLE
Square array begins:
1, 1, 1, 1, 1, 1, ...
3, 3, 3, 3, 3, 3, ...
3, 12, 21, 30, 39, 48, ...
3, 57, 192, 408, 705, 1083, ...
3, 300, 2001, 6402, 14799, 28488, ...
3, 1686, 22539, 109137, 338430, 817743, ...
MATHEMATICA
T[0, k_] := 1; T[n_, k_] := Sum[3^j * Binomial[n, j] * Binomial[k*n, j - 1], {j, 1, n}]/n; Table[T[k, n - k], {n, 0, 10}, {k, 0, n}] // Flatten (* Amiram Eldar, Jul 27 2020 *)
PROG
(PARI) T(n, k) = if(n==0, 1, sum(j=1, n, 3^j*binomial(n, j)*binomial(k*n, j-1))/n);
(PARI) T(n, k) = my(A=1+x*O(x^n)); for(i=0, n, A=1+x*A^k*(2+A)); polcoeff(A, n);
(PARI) T(n, k) = sum(j=0, n, 2^(n-j)*binomial(n, j)*binomial(k*n+j+1, n)/(k*n+j+1));
(PARI) T(n, k) = sum(j=0, n, 2^j*binomial(k*n+1, j)*binomial((k+1)*n-j, n-j))/(k*n+1);
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Seiichi Manyama, Jul 26 2020
STATUS
approved