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.

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

Original entry on oeis.org

2, 16, 72, 576, 7744, 138384, 3773248, 143233024, 7961867964, 694232238436, 87251969161984, 15584659071915024, 4290136697951345984, 1785288592992685527184, 1059504761310616996153800
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Diagonal of A207928

Examples

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