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!)
A181724 The number of paths of a chess rook in a 8D 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, 40320, 214899027840, 2509137924026751360, 41795104403987233709518080, 852847938704373386478865686645120, 19846219244619878972245087341015659057280, 506348195597089273505079176351561351976609740160 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

EXAMPLE

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

CROSSREFS

Row d=8 of A181731.

Sequence in context: A172541 A287084 A071550 * A072269 A259113 A195392

Adjacent sequences:  A181721 A181722 A181723 * A181725 A181726 A181727

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 October 28 17:59 EDT 2021. Contains 348329 sequences. (Running on oeis4.)