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.

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

Original entry on oeis.org

2, 16, 92, 742, 13260, 220882, 4094666, 129528304, 4643477356, 183171965504, 10948746139548, 797831881523648, 65446536338563458, 7746605907720894574, 1149785247198798823392, 195841032765969991278104
Offset: 1

Views

Author

R. H. Hardin Feb 17 2012

Keywords

Comments

Diagonal of A207419

Examples

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