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.

A221628 Number of 6Xn 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, 7, 7279, 14576404, 230141263315, 7575106427737240, 827196295133181978340, 177037611175595181692394660, 86030164534670200470739520304375, 75149351745335662460465241596540458600
Offset: 1

Views

Author

R. H. Hardin Jan 21 2013

Keywords

Comments

Row 6 of A221623

Examples

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