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.

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

Original entry on oeis.org

2, 16, 102, 720, 6398, 54684, 468348, 4356936, 41716708, 403445900, 4037337213, 41571957024, 435311467198, 4653843868560, 50835606848268, 564791240516000, 6378296516533122, 73247208566761530, 853936849893078000
Offset: 1

Views

Author

R. H. Hardin Feb 14 2012

Keywords

Comments

Diagonal of A207068

Examples

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