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.

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

Original entry on oeis.org

2, 16, 78, 855, 8736, 272206, 6206445, 613538688, 30091441770, 9949962265465, 995860712362464, 1146808937112275178, 223896318271083352427, 927305041435819383020944, 341298409330345173624970966
Offset: 1

Views

Author

R. H. Hardin Mar 01 2012

Keywords

Comments

Diagonal of A208840

Examples

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