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!)
A181728 The number of paths of a chess rook in a 12D 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). 2

%I #8 Jul 21 2012 19:06:47

%S 1,479001600,402910665227270323200,1193980357099103775859825737292800,

%T 6221349234739584150822122029143772173312614400,

%U 44698730304001991182769831137859339764690493418024756096000,395245742455869432937361185087176756463979731526578123254618890928614400

%N The number of paths of a chess rook in a 12D 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) = 479001600 because there are 479001600 rook paths from (0..0) to (1..1).

%Y Row d=12 of A181731.

%K nonn

%O 0,2

%A _Manuel Kauers_, Nov 16 2010

%E a(6) from _Alois P. Heinz_, Jul 21 2012

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 09:56 EDT 2024. Contains 371967 sequences. (Running on oeis4.)