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.

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

Original entry on oeis.org

2, 16, 98, 1309, 30160, 1415508, 126827983, 22125222702, 7392844742356, 4723174261254577, 5746602867110840996, 13284653021118899451246, 58277226038377671962460367, 484690813727478247761183804458
Offset: 1

Views

Author

R. H. Hardin Mar 01 2012

Keywords

Comments

Diagonal of A208698

Examples

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