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.

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

Original entry on oeis.org

2, 16, 90, 784, 5856, 42849, 353808, 2792241, 21195317, 182223001, 1372615690, 11550015841, 91115397450, 745461286801, 5965914998428, 49005684164836, 389634565985060, 3219980044337424
Offset: 1

Views

Author

R. H. Hardin, Feb 17 2012

Keywords

Comments

Diagonal of A207368.

Examples

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

Crossrefs

Cf. A207368.