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.

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

Original entry on oeis.org

16, 108, 1296, 12000, 160000, 1715000, 24010000, 280052640, 4032758016, 49700008512, 728933458176, 9337998878208, 138735983333376, 1829038842774000, 27435582641610000, 369797030228340000, 5588044012339360000
Offset: 1

Views

Author

R. H. Hardin, Nov 22 2014

Keywords

Comments

Diagonal of A250432.

Examples

			Some solutions for n=5
..0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..1..0
..0..0..0..0..1..0....0..0..0..1..0..1....0..0..0..0..1..1....0..0..0..1..1..1
..0..0..0..1..1..1....0..0..0..0..1..1....0..0..0..1..1..1....1..0..1..0..1..1
..0..0..0..0..1..0....0..0..0..1..1..1....0..1..1..1..1..1....0..1..0..1..1..1
..1..1..1..1..1..1....1..0..1..0..1..1....1..1..1..1..1..1....1..0..1..0..1..1
..0..0..0..1..1..1....1..0..1..1..1..1....0..1..1..1..1..1....0..1..0..1..1..1
		

Crossrefs

Formula

a(n+1) = A202092(n). - R. J. Mathar, Dec 04 2014