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.

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

Original entry on oeis.org

2, 16, 90, 1089, 10080, 150544, 1913940, 33930625, 544003170, 11177987076, 215177010048, 5033386477441, 112708053008152, 2958949185458176, 75387859827570360, 2195709810260687361, 62623865365172370000
Offset: 1

Views

Author

R. H. Hardin Feb 28 2012

Keywords

Comments

Diagonal of A208555.

Examples

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

Crossrefs

Cf. A208555.