OFFSET
0,5
LINKS
G. C. Greubel, Rows n = 0..100 of triangle, flattened
FORMULA
T(n,k) = Sum_{j=0..n-k} binomial(n-j, 2*(n-k-j) -1) with T(n,n)=1 in the region n >= 0, 0 <= k <= n. - G. C. Greubel, Sep 29 2019
EXAMPLE
Triangle begins with:
1;
1, 1;
1, 2, 1;
1, 3, 3, 1;
1, 3, 7, 4, 1;
1, 3, 8, 14, 5, 1;
1, 3, 8, 20, 25, 6, 1;
1, 3, 8, 21, 46, 41, 7, 1; ...
MAPLE
T:= proc(n, k)
if k=n then 1
else add(binomial(n-j, 2*(n-k-j)-1), j=0..n-k)
fi
end:
seq(seq(T(n, k), k=0..n), n=0..12); # G. C. Greubel, Sep 29 2019
MATHEMATICA
T[n_, k_]:= If[k==n, 1, Sum[Binomial[n-j, 2*(n-k-j)-1], {j, 0, n-k}]];
Table[T[n, k], {n, 0, 10}, {k, 0, n}]//Flatten (* G. C. Greubel, Sep 29 2019 *)
PROG
(PARI) T(n, k) = if(k==n, 1, sum(j=0, n-k, binomial(n-j, 2*(n-k-j)-1)) );
for(n=0, 12, for(k=0, n, print1(T(n, k), ", "))) \\ G. C. Greubel, Sep 29 2019
(Magma) T:= func< n, k | k eq n select 1 else &+[Binomial(n-j, 2*(n-k-j) -1): j in [0..n-k]] >;
[T(n, k): k in [0..n], n in [0..12]]; // G. C. Greubel, Sep 29 2019
(Sage)
def T(n, k):
if (k==n): return 1
else: return sum(binomial(n-j, 2*(n-k-j)-1) for j in (0..n-k))
[[T(n, k) for k in (0..n)] for n in (0..12)] # G. C. Greubel, Sep 29 2019
(GAP)
T:= function(n, k)
if k=n then return 1;
else return Sum([0..n-k], j-> Binomial(n-j, 2*(n-k-j)-1) );
fi;
end;
Flat(List([0..12], n-> List([0..n], k-> T(n, k) ))); # G. C. Greubel, Sep 29 2019
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
EXTENSIONS
Name edited by G. C. Greubel, Sep 29 2019
STATUS
approved