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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
1, 39916800, 1456812592995513600, 166369951631853645510591187200, 31707078596527364069316526441204831526400, 8089435115221815003427192379950659547969112311680000, 2492107900477900258313589438717998843635090670139189341868499200 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
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
KEYWORD
nonn
AUTHOR
Manuel Kauers, Nov 16 2010
EXTENSIONS
a(6) from Alois P. Heinz, Jul 21 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:14 EDT 2024. Contains 371964 sequences. (Running on oeis4.)