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.

A207466 Number of nX7 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 0 and 1 0 1 vertically.

Original entry on oeis.org

25, 625, 3399, 33393, 247631, 2090927, 16675001, 136803627, 1107817969, 9020755725, 73241249411, 595437782873, 4838237303149, 39325402627329, 319598032561739, 2597506529364501, 21110282812302019, 171568068317114121
Offset: 1

Views

Author

R. H. Hardin Feb 18 2012

Keywords

Comments

Column 7 of A207467

Examples

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