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.

A201536 Number of nX5 0..2 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.

Original entry on oeis.org

9, 175, 3354, 91425, 2446147, 61807736, 1408677515, 28646055184, 523398227137, 8686880778087, 132361720458239, 1868645862989467, 24631940812325029, 305098771555173655, 3569810381726216867, 39630824798203404663
Offset: 1

Views

Author

R. H. Hardin Dec 02 2011

Keywords

Comments

Column 5 of A201539

Examples

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