|
A246623
|
|
Number of paths of a chess rook in an n-dimensional 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 #3 Aug 31 2014 14:11:24
%S 1,1,14,9918,964948464,25071989721176760,284751719071722748492598160,
%T 2093930745462011336917616846237237197680,
%U 13828562491398961948219629077212979214965847920914986240,108581107327233631269616107897051314148463756259194308769323017769436778880
%N Number of paths of a chess rook in an n-dimensional 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).
%Y Main diagonal of A181731.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Aug 31 2014
|
