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.

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

Original entry on oeis.org

2, 16, 102, 729, 4212, 26896, 154580, 970225, 5697150, 36000000, 216023850, 1377968641, 8411571224, 54080432704, 334469528520, 2163643890489, 13517662791690, 87865126849600, 553380551724110, 3610810383420361
Offset: 1

Views

Author

R. H. Hardin Feb 17 2012

Keywords

Comments

Diagonal of A207403

Examples

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