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.

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

Original entry on oeis.org

2, 16, 102, 987, 13876, 197256, 3510185, 71594896, 1760487825, 47844199134, 1511863246821, 57304254157049, 2367852660685470, 115523120639939042, 6698200226978686505, 429360115542695358515, 32711874875890241470483
Offset: 1

Views

Author

R. H. Hardin, Feb 16 2012

Keywords

Comments

Diagonal of A207242.

Examples

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

Crossrefs

Cf. A207242.