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.

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

Original entry on oeis.org

2, 16, 78, 441, 8575, 277729, 4799749, 93547584, 8978585264, 1701743731081, 92421758243781, 5198831216732241, 3314060538084914409, 4426079717506620317769, 675694617961142291654422
Offset: 1

Views

Author

R. H. Hardin, Feb 19 2012

Keywords

Comments

Diagonal of A207729.

Examples

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

Crossrefs

Cf. A207729.