login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A181749 The number of paths of a chess rook in a 4D 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, 24, 6384, 2306904, 964948464, 439331916888, 211383647188320, 105734905550405400, 54434276297806242480, 28652982232251791825880, 15350736081585866511795024, 8343014042738696079671066904, 4588687856038215036178166258304 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

EXAMPLE

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

CROSSREFS

Row d=4 of A181731.

Sequence in context: A163576 A145408 A175672 * A181232 A088616 A158042

Adjacent sequences:  A181746 A181747 A181748 * A181750 A181751 A181752

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 | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 26 04:23 EDT 2013. Contains 225653 sequences.