The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A181726 The number of paths of a chess rook in a 10D 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, 3628800, 6290830003852800, 30306073546461323055916800, 231242270452155338291905203314956800, 2293197130058463838438742129627609575368940800, 26941822036577030394903099245279465611395585827577676800 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Table of n, a(n) for n=0..6. EXAMPLE a(1) = 3628800 because there are 3628800 rook paths from (0..0) to (1..1). CROSSREFS Row d=10 of A181731. Sequence in context: A227672 A172540 A071552 * A195394 A053501 A229677 Adjacent sequences: A181723 A181724 A181725 * A181727 A181728 A181729 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 | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 16 10:29 EDT 2024. Contains 371709 sequences. (Running on oeis4.)