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.

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

Original entry on oeis.org

2, 16, 102, 1024, 12288, 175561, 2330037, 40119556, 667127008, 12622297801, 236060280854, 5051251755001, 104507364758952, 2416776784204176, 54925343492859621, 1369884877162739344, 33478733130375924736
Offset: 1

Views

Author

R. H. Hardin Feb 15 2012

Keywords

Comments

Diagonal of A207123

Examples

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