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.

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

Original entry on oeis.org

2, 16, 84, 870, 11196, 205258, 5888458, 243318702, 13997746826, 1221755612002, 156218303323950, 28414320426633740, 7652673923813342076, 3016400502880224884497, 1720903600232362236817474
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Diagonal of A207895

Examples

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