login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

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

Adjacent sequences:  A181722 A181723 A181724 * A181726 A181727 A181728

KEYWORD

nonn

AUTHOR

Manuel Kauers, Nov 16 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 28 06:57 EDT 2021. Contains 347703 sequences. (Running on oeis4.)