b:= proc(n, f, m, l, j) option remember; (k-> `if`(n<add(i, i=f)+m+
add(i, i=l), 0, `if`(n=0, 1, add(`if`(f[i]=0, 0, b(n-1,
subsop(i=0, f), m+l[1], [subsop(1=[][], l)[], 0], max(0, j-1))),
i=max(1, j+1)..min(k, n-1))+`if`(m=0, 0, m*b(n-1, f, m-1+l[1],
[subsop(1=[][], l)[], 0], max(0, j-1)))+b(n-1, f, m+l[1],
[subsop(1=[][], l)[], 1], max(0, j-1)))))(nops(l))
end:
A:= (n, k)-> `if`(n=0 or k<2, doublefactorial(2*n-1),
b(2*n-k+1, [1$k-1], 0, [0$k-1], k-1)):
T:= (n, k)-> `if`(n=k, 1, A(n, k)-A(n, k+1)):
seq(seq(T(n, k), k=0..n), n=0..10);