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.

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

Original entry on oeis.org

2, 16, 114, 2205, 97580, 10150118, 2433018665, 1332236625328, 1658417176295910, 4680320299339768945, 29900757895299392674248, 432064042048194196301219286, 14114419978195735103237247653751, 1042092211595049585701702108677740928
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Diagonal of A207717

Examples

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