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.

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

Original entry on oeis.org

2, 16, 90, 603, 3445, 15789, 98224, 645217, 3227100, 18747520, 128798244, 720878886, 4180036645, 28917238756, 176708726320, 1057330250552, 7322809072734, 47678383274385, 297647051017140, 2072720881428948
Offset: 1

Views

Author

R. H. Hardin, Feb 15 2012

Keywords

Comments

Diagonal of A207169.

Examples

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

Crossrefs

Cf. A207169.