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.

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

Original entry on oeis.org

490000, 60025000, 7353062500, 345888060000, 16270574342400, 410018473428480, 10332465530397696, 167006381634183168, 2699368454168838144, 31245878471405875200, 361679014193888160000, 3225176243350261200000
Offset: 1

Views

Author

R. H. Hardin, Dec 12 2014

Keywords

Comments

Column 6 of A251974.

Examples

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

Crossrefs

Cf. A251974.