[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A181750
The number of paths of a chess rook in a 5D 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, 120, 291720, 1085674320, 4927561419120, 25071989721176760, 137401053406474591320, 793279085081986319145120, 4760210822189950253433759120, 29426738284267047709626231969120, 186257720453050086737999575854359760, 1201788369927033696254110199515917069120
(list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
Table of n, a(n) for n=0..11.
EXAMPLE
a(1) = 120 because there are 120 rook paths from (0..0) to (1..1).
CROSSREFS
Row d=5 of A181731.
Sequence in context: A008701 A158043 A009767 * A003789 A325024 A325026
Adjacent sequences: A181747 A181748 A181749 * A181751 A181752 A181753
KEYWORD
nonn
AUTHOR
Manuel Kauers, Nov 16 2010
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified October 4 21:32 EDT 2024. Contains 376525 sequences.
License Agreements, Terms of Use, Privacy Policy