login
The number of paths of a chess rook in a 11D 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 #9 Jul 21 2012 19:06:19

%S 1,39916800,1456812592995513600,166369951631853645510591187200,

%T 31707078596527364069316526441204831526400,

%U 8089435115221815003427192379950659547969112311680000,2492107900477900258313589438717998843635090670139189341868499200

%N The number of paths of a chess rook in a 11D 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) = 39916800 because there are 39916800 rook paths from (0..0) to (1..1).

%Y Row d=11 of A181731.

%K nonn

%O 0,2

%A _Manuel Kauers_, Nov 16 2010

%E a(6) from _Alois P. Heinz_, Jul 21 2012