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.

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

Original entry on oeis.org

2, 16, 102, 900, 8778, 104976, 1341606, 20115225, 316615970, 5707953601, 106646250804, 2244863934369, 48526426817904, 1167193108267264, 28644642089792472, 774480816028370889, 21267135535735987266
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Diagonal of A207752

Examples

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