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.

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

Original entry on oeis.org

2, 16, 78, 927, 12096, 301035, 6398617, 358035204, 14996975204, 1866358422700, 142488171799491, 43994512655386488, 5996882020078059149, 4716359423241404452425, 1123534623785504112746542
Offset: 1

Views

Author

R. H. Hardin Mar 01 2012

Keywords

Comments

Diagonal of A208688.

Examples

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

Crossrefs

Cf. A208688.