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.

A250436 Number of (n+1)X(n+1) 0..2 arrays with nondecreasing sum of every two consecutive values in every row and column.

Original entry on oeis.org

81, 2160, 160000, 8750000, 937890625, 74118870000, 9682651996416, 958582547645184, 141763707879526656, 16346105372357849088, 2632478657451209588736, 338880211548064890612480
Offset: 1

Views

Author

R. H. Hardin, Nov 22 2014

Keywords

Comments

Diagonal of A250443

Examples

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