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.

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

Original entry on oeis.org

2, 16, 92, 636, 9568, 138017, 3275898, 100565794, 5427850334, 274972547840, 35540211201327, 3458816367555240, 1051654956960360726, 183797069898348851705, 149794018569432287405504
Offset: 1

Views

Author

R. H. Hardin Feb 18 2012

Keywords

Comments

Diagonal of A207564

Examples

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