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.

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

Original entry on oeis.org

2, 16, 82, 575, 4387, 33631, 618202, 12501427, 214612008, 11062960730, 657453772615, 25402400315447, 3733312830860298, 643896610977129232, 54640540348513184649, 23181398334398528895458, 11714931649831496203623180
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Diagonal of A207885

Examples

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