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.

A221627 Number of 5Xn 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, 6, 1818, 1130256, 3451956516, 21241004664348, 332469512259607296, 9510929074212911717760, 521875340203828179569609700, 47602100904962622927705491352020, 7181861163349151796773697873026037828
Offset: 1

Views

Author

R. H. Hardin Jan 21 2013

Keywords

Comments

Row 5 of A221623

Examples

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