OFFSET
1,5
COMMENTS
The table is enumerated along antidiagonals: A(1,0), A(2,0), A(1,1), A(3,0), A(2,1), A(1,2), A(4,0), A(3,1), A(2,2), A(1,3), ... .
LINKS
Alois P. Heinz, Antidiagonals n = 1..20
M. Kauers and D. Zeilberger, The Computational Challenge of Enumerating High-Dimensional Rook Walks, arXiv:1011.4671 [math.CO], 2010.
EXAMPLE
A(3,1) = 6 because there are 6 rook paths on 3D chessboards from (0,0,0) to (1,1,1).
Square table A(d,n) begins:
1, 1, 2, 4, 8, ...
1, 2, 14, 106, 838, ...
1, 6, 222, 9918, 486924, ...
1, 24, 6384, 2306904, 964948464, ...
1, 120, 291720, 1085674320, 4927561419120, ...
MAPLE
b:= proc(l) option remember; `if`({l[]} minus {0}={}, 1, add(add
(b(sort(subsop(i=l[i]-j, l))), j=1..l[i]), i=1..nops(l)))
end:
A:= (d, n)-> b([n$d]):
seq(seq(A(h-n, n), n=0..h-1), h=1..10); # Alois P. Heinz, Jul 21 2012
MATHEMATICA
b[l_List] := b[l] = If[Union[l] ~Complement~ {0} == {}, 1, Sum[ Sum[ b[ Sort[ ReplacePart[l, i -> l[[i]] - j]]], {j, 1, l[[i]]}], {i, 1, Length[l]}]]; A[d_, n_] := b[Array[n&, d]]; Table[Table[A[h-n, n], {n, 0, h-1}], {h, 1, 10}] // Flatten (* Jean-François Alcover, Feb 25 2015, after Alois P. Heinz *)
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Manuel Kauers, Nov 16 2010
EXTENSIONS
Edited by Alois P. Heinz, Jul 21 2012
Minor edits by Vaclav Kotesovec, Sep 03 2014
STATUS
approved