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.

A221621 Number of nX6 arrays with each row a permutation of 1..6 having at least as many downsteps as the preceding row.

Original entry on oeis.org

720, 353654, 148700748, 57614883627, 21241004664348, 7575106427737240, 2638115823321645192, 902542985526634773509, 304529313276100670030616, 101620178879261858322711162, 33604296810830843896378600020
Offset: 1

Views

Author

R. H. Hardin Jan 21 2013

Keywords

Comments

Column 6 of A221623

Examples

			Some solutions for n=3
..4..1..2..5..3..6....4..1..2..5..3..6....4..1..2..5..3..6....4..1..2..5..3..6
..1..4..6..3..5..2....3..1..2..5..4..6....4..1..2..6..5..3....3..1..5..4..6..2
..2..1..4..3..6..5....3..6..2..5..4..1....5..4..6..3..1..2....2..1..4..3..6..5
		

Formula

Empirical: a(n) = 720*a(n-1) -164746*a(n-2) +12686988*a(n-3) -321204409*a(n-4) +605003244*a(n-5) -296321796*a(n-6)