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.

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

Original entry on oeis.org

2, 16, 72, 438, 2638, 10340, 50322, 221672, 938572, 4001444, 16081184, 65882872, 265536422, 1041167756, 4136910380, 16075083164, 62441083194, 240925209706, 924668629616, 3528820338804, 13446998876758, 50858295309890
Offset: 1

Views

Author

R. H. Hardin, Feb 18 2012

Keywords

Comments

Diagonal of A207514.

Examples

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

Crossrefs

Cf. A207514.