OFFSET
0,2
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..250
MAPLE
T:= proc(i, j) option remember;
if i=0 or j=0 then 1
else add(add(T(h, m), m=0..j), h=0..i-1)
fi; end:
seq(T(n+4, n), n=0..30); # G. C. Greubel, Jan 22 2020
MATHEMATICA
T[i_, j_]:= T[i, j]= If[i==0 || j==0, 1, Sum[T[h, m], {h, 0, i-1}, {m, 0, j}]]; Table[T[n+4, n], {n, 0, 25}] (* G. C. Greubel, Jan 22 2020 *)
PROG
(Sage)
@CachedFunction
def T(i, j):
if (i==0 or j==0): return 1
else: return sum(sum(T(h, m) for m in (0..j)) for h in (0..i-1))
[T(n+4, n) for n in (0..30)] # G. C. Greubel, Jan 22 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, May 28 2000
STATUS
approved