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.

A202972 Number of n X n 0..1 arrays with every nonzero element less than or equal to at least two horizontal and vertical neighbors.

Original entry on oeis.org

1, 2, 17, 385, 31380, 8071997, 6330398606, 15305115754880, 113359928263133320, 2565928235760939767164, 177686302889022383527488349, 37653160193950657089306550224687, 24413727008012244865702150476410950284
Offset: 1

Views

Author

R. H. Hardin Dec 26 2011

Keywords

Comments

Diagonal of A202979

Examples

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