A246623 - cp's OEIS frontend

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).

n	a(n)
0	1
1	1
2	14
3	9918
4	964948464
5	25071989721176760
6	284751719071722748492598160
7	2093930745462011336917616846237237197680
8	13828562491398961948219629077212979214965847920914986240
9	108581107327233631269616107897051314148463756259194308769323017769436778880

[1, 1, 14, 9918, 964948464, 25071989721176760, 284751719071722748492598160, 2093930745462011336917616846237237197680, 13828562491398961948219629077212979214965847920914986240, 108581107327233631269616107897051314148463756259194308769323017769436778880]

cp's OEIS Frontend

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).

Table of values

List of values