OFFSET
0,5
COMMENTS
LINKS
G. C. Greubel, Antidiagonal rows n = 0..50, flattened
FORMULA
T(n, k) = Sum_{j=0..n} binomial(k*n -(k-1)*(j-1), j), n, k>=0. (square array)
T(n, k) = Sum_{j=0..n} binomial(k + (n-1)*(j+1), n*(j+1) -1), n>0. (square array)
T(n, k) = Sum_{j=0..n-k} binomial(k*(n-k) - (k-1)*(j-1), j). (number triangle)
Rows of the square array are generated by 1/((1-x)^k-x).
Rows satisfy a(n) = a(n-1) - Sum_{k=1..n} (-1)^(k^binomial(n, k)) * a(n-k).
EXAMPLE
Rows begin
1, 1, 1, 1, 1, ... A000012;
1, 2, 4, 8, 16, ... 1-section of 1/(1-x-x) A000079;
1, 3, 8, 21, 55, .... bisection of 1/(1-x-x^2) A001906;
1, 4, 13, 41, 129, ... trisection of 1/(1-x-x^3) A052529; (essentially)
1, 5, 19, 69, 250, ... quadrisection of 1/(1-x-x^4) A055991;
1, 6, 26, 106, 431, ... quintisection of 1/(1-x-x^5) A079675; (essentially)
MATHEMATICA
T[n_, k_]:= Sum[Binomial[k*(n-k) - (k-1)*(j-1), j], {j, 0, n-k}];
Table[T[n, k], {n, 0, 12}, {k, 0, n}]//Flatten (* G. C. Greubel, Mar 09 2021 *)
PROG
(Sage)
def A099239(n, k): return sum( binomial(k*(n-k) -(k-1)*(j-1), j) for j in (0..n-k) )
flatten([[A099239(n, k) for k in (0..n)] for n in (0..12)]) # G. C. Greubel, Mar 09 2021
(Magma)
A099239:= func< n, k | (&+[Binomial(k*(n-k) -(k-1)*(j-1), j): j in [0..n-k]]) >;
[A099239(n, k): k in [0..n], n in [0..12]]; // G. C. Greubel, Mar 09 2021
CROSSREFS
KEYWORD
AUTHOR
Paul Barry, Oct 08 2004
STATUS
approved