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.

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

Original entry on oeis.org

2, 16, 98, 1309, 21145, 612439, 28188778, 2088382007, 241159388724, 45610488555258, 13703703085638203, 6587710602249205713, 5068113112003743826155, 6252316203337352775508286
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Diagonal of A207918

Examples

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