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.

A238250 Number of (n+1)X(3+1) 0..1 arrays with 2X2 subblock sums lexicographically nondecreasing columnwise and rowwise.

Original entry on oeis.org

121, 804, 6828, 43456, 284992, 1473792, 7616082, 32986844, 142361644, 537301496, 2020791427, 6843417893, 23099713493, 71683038307, 221767602558, 640525984280, 1844757869502, 5018918602972, 13619020527533, 35234899933725
Offset: 1

Views

Author

R. H. Hardin, Feb 21 2014

Keywords

Comments

Column 3 of A238255

Examples

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

Formula

Empirical recurrence of order 81 (see link above)