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.

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

Original entry on oeis.org

1, 16383, 10450787266, 71832238695530495, 2891333179750701904296876, 475997448692406224810330915906802, 252848108054080530934326716965286554552380
Offset: 1

Views

Author

R. H. Hardin May 31 2012

Keywords

Comments

Row 7 of A212930

Examples

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