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.

A212933 Number of 4Xn 0..n-1 arrays with no column j greater than column j-1 in all rows.

Original entry on oeis.org

1, 255, 518320, 4041974015, 85800824609376, 4051316109991426752, 372271852759802667094256, 60525940157456181486116315391, 16213293097463939456656505907266320
Offset: 1

Views

Author

R. H. Hardin May 31 2012

Keywords

Comments

Row 4 of A212930

Examples

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