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.

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

Original entry on oeis.org

2, 16, 102, 1970, 57184, 3511534, 388134978, 82999241712, 33304563708790, 25409866877400042, 36648009080479725120, 100161609586888545878490, 518205987191621802807914102, 5077481011895003740693688753360
Offset: 1

Views

Author

R. H. Hardin, Feb 20 2012

Keywords

Comments

Diagonal of A207808.

Examples

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

Crossrefs

Cf. A207808.