A181727 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

Other ways to Give

A181727

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, 39916800, 1456812592995513600, 166369951631853645510591187200, 31707078596527364069316526441204831526400, 8089435115221815003427192379950659547969112311680000, 2492107900477900258313589438717998843635090670139189341868499200

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

LINKS

Table of n, a(n) for n=0..6.

EXAMPLE

a(1) = 39916800 because there are 39916800 rook paths from (0..0) to (1..1).

CROSSREFS

Row d=11 of A181731.

Sequence in context: A011522 A172539 A198809 * A307477 A218390 A186617

Adjacent sequences: A181724 A181725 A181726 * A181728 A181729 A181730

KEYWORD

nonn

AUTHOR

Manuel Kauers, Nov 16 2010

EXTENSIONS

a(6) from Alois P. Heinz, Jul 21 2012

STATUS

approved