login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A181725
The number of paths of a chess rook in a 9D 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
1, 362880, 33007837322880, 7408611474125625953280, 2499611266020127048565292881280, 1064141699563485513180737844317706666240, 526577363627345975232160422620146408876598167680, 289514065258843883748159731480148589989905149052842682880
OFFSET
0,2
EXAMPLE
a(1) = 362880 because there are 362880 rook paths from (0..0) to (1..1).
CROSSREFS
Row d=9 of A181731.
Sequence in context: A172536 A287085 A071551 * A195393 A229676 A230754
KEYWORD
nonn
AUTHOR
Manuel Kauers, Nov 16 2010
STATUS
approved