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!)
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
1, 479001600, 402910665227270323200, 1193980357099103775859825737292800, 6221349234739584150822122029143772173312614400, 44698730304001991182769831137859339764690493418024756096000, 395245742455869432937361185087176756463979731526578123254618890928614400 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

EXAMPLE

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

CROSSREFS

Row d=12 of A181731.

Sequence in context: A072232 A011523 A172535 * A233840 A203671 A251307

Adjacent sequences:  A181725 A181726 A181727 * A181729 A181730 A181731

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 28 17:55 EDT 2021. Contains 348329 sequences. (Running on oeis4.)