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.

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

Original entry on oeis.org

2, 16, 90, 841, 5952, 43264, 393049, 4084441, 32673396, 334012176, 3665311664, 37536737536, 385814058880, 4801282939489, 53629177761313, 628423124320161, 7905277739708518, 101862335149216849, 1250237739999352500
Offset: 1

Views

Author

R. H. Hardin, Feb 22 2012

Keywords

Comments

Diagonal of A208013.

Examples

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

Crossrefs

Cf. A208013.