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.

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

Original entry on oeis.org

2, 16, 84, 828, 9668, 128292, 2367656, 53882188, 1466226618, 53206438448, 2394759800657, 133358534841765, 9689628432751700, 882639945891070144, 101352502023903785258, 15016562984066207345796, 2813722789748877650099592
Offset: 1

Views

Author

R. H. Hardin Feb 17 2012

Keywords

Comments

Diagonal of A207346

Examples

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