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.

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

Original entry on oeis.org

256, 20000, 6250000, 1500625000, 922368160000, 410018473428480, 371968759094317056, 244967687215822061568, 286806250077948918890496, 248333886971163312349814784, 348300471444720308054703841536
Offset: 1

Views

Author

R. H. Hardin, Dec 12 2014

Keywords

Comments

Diagonal of A251974.

Examples

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

Crossrefs

Cf. A251974.