Table A(d,n) of the number of paths of a chess rook in a d-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).
A181731
Table A(d,n) of the number of paths of a chess rook in a d-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).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =2a(6) =1a(7) =6a(8) =14a(9) =4a(10) =1a(11) =24a(12) =222a(13) =106a(14) =8a(15) =1a(16) =120a(17) =6384a(18) =9918a(19) =838a(20) =16a(21) =1a(22) =720a(23) =291720a(24) =2306904a(25) =486924a(26) =6802a(27) =32a(28) =1a(29) =5040
External references
- oeis: A181731