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

%I

%S 1,362880,33007837322880,7408611474125625953280,

%T 2499611266020127048565292881280,

%U 1064141699563485513180737844317706666240,526577363627345975232160422620146408876598167680,289514065258843883748159731480148589989905149052842682880

%N 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).

%e a(1) = 362880 because there are 362880 rook paths from (0..0) to (1..1).

%Y Row d=9 of A181731.

%K nonn

%O 0,2

%A _Manuel Kauers_, Nov 16 2010

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 23 04:06 EDT 2021. Contains 348211 sequences. (Running on oeis4.)