cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A181724 The number of paths of a chess rook in a 8D 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).

Original entry on oeis.org

1, 40320, 214899027840, 2509137924026751360, 41795104403987233709518080, 852847938704373386478865686645120, 19846219244619878972245087341015659057280, 506348195597089273505079176351561351976609740160
Offset: 0

Views

Author

Manuel Kauers, Nov 16 2010

Keywords

Examples

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

Crossrefs

Row d=8 of A181731.