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.

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

Original entry on oeis.org

2, 16, 82, 530, 4041, 26980, 268275, 2555724, 30415590, 441509828, 8373148373, 212120269939, 7313507695094, 322966671937819, 18599518847838594, 1383707197762948671, 137553485485585731530, 16701189911469748208243
Offset: 1

Views

Author

R. H. Hardin Feb 18 2012

Keywords

Comments

Diagonal of A207488

Examples

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