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.

A221625 Number of 3Xn 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, 4, 112, 6120, 738150, 148700748, 49096652080, 24099422236160, 17023170538890750, 16517958827528755300, 21433818529290626472948, 36180795747764068402865136, 77856103174007703918070147632
Offset: 1

Views

Author

R. H. Hardin Jan 21 2013

Keywords

Comments

Row 3 of A221623

Examples

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