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.

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

Original entry on oeis.org

2, 16, 72, 576, 3696, 26244, 198000, 1638400, 12913840, 117722500, 1052059680, 10059287616, 97769309736, 1020075760144, 10507456855392, 116747852120064, 1295601058976256, 15148523442518244, 177995312325281880
Offset: 1

Views

Author

R. H. Hardin Feb 23 2012

Keywords

Comments

Diagonal of A208069

Examples

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