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.

A250569 Number of (n+2) X (3+2) 0..1 arrays with nondecreasing maximum of every three consecutive values in every row and column.

Original entry on oeis.org

21952, 463006, 9583440, 194160522, 3844025984, 75733658665, 1486288137310, 29093999130722, 568992945964954, 11121085195129708, 217289681422138350, 4244862050968522642, 82917728735945546896, 1619605399294091536443
Offset: 1

Views

Author

R. H. Hardin, Nov 25 2014

Keywords

Comments

Column 3 of A250574.

Examples

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

Crossrefs

Cf. A250574.