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.

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

Original entry on oeis.org

2, 16, 102, 981, 14446, 297702, 9072707, 424153857, 29316311612, 3025550427476, 473181884230845, 111694857841157921, 39694965205591894619, 21331992417577197285058, 17352141355803100139646251
Offset: 1

Views

Author

R. H. Hardin Feb 24 2012

Keywords

Comments

Diagonal of A208164

Examples

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