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.

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

Original entry on oeis.org

2, 16, 102, 940, 9072, 101036, 1231650, 16436824, 237255370, 3684061372, 61152471648, 1079792961548, 20191392448058, 398344602963240, 8263930584283206, 179759826117751524, 4089350929606635216
Offset: 1

Views

Author

R. H. Hardin Feb 16 2012

Keywords

Comments

Diagonal of A207254

Examples

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