login
The number of paths of a chess rook in a 10D hypercube, from (0..0) to (n..n), where the rook may move in steps that are multiples of (1,0..0), (0,1,0..0), ..., (0..0,1).
1

%I #7 Jul 21 2012 19:06:00

%S 1,3628800,6290830003852800,30306073546461323055916800,

%T 231242270452155338291905203314956800,

%U 2293197130058463838438742129627609575368940800,26941822036577030394903099245279465611395585827577676800

%N The number of paths of a chess rook in a 10D hypercube, from (0..0) to (n..n), where the rook may move in steps that are multiples of (1,0..0), (0,1,0..0), ..., (0..0,1).

%e a(1) = 3628800 because there are 3628800 rook paths from (0..0) to (1..1).

%Y Row d=10 of A181731.

%K nonn

%O 0,2

%A _Manuel Kauers_, Nov 16 2010