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.

A207874 Number of n X n 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 0 and 1 1 1 vertically.

Original entry on oeis.org

2, 16, 72, 400, 1648, 10742, 51696, 380632, 2048344, 17181610, 99927528, 1001175276, 6019939360, 76617072388, 455429901920, 7551993118538, 45011858516784, 1023575674079354, 6041127787154280
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Diagonal of A207879

Examples

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