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.

A221618 Number of n X n arrays with each row a permutation of 1..n having at least as many downsteps as the preceding row.

Original entry on oeis.org

1, 3, 112, 85035, 3451956516, 7575106427737240, 2031241364747667201263520, 57096186419355436503540544000542003, 350680349722258761627197454626353435730368352560
Offset: 1

Views

Author

R. H. Hardin Jan 21 2013

Keywords

Comments

Diagonal of A221623

Examples

			Some solutions for n=3
..1..2..3....1..2..3....3..1..2....3..1..2....2..1..3....1..2..3....2..3..1
..2..1..3....3..1..2....3..1..2....2..3..1....1..3..2....1..3..2....3..1..2
..3..2..1....3..2..1....2..3..1....3..1..2....2..3..1....3..2..1....3..1..2