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.

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

Original entry on oeis.org

2, 16, 102, 1369, 18172, 362404, 7513176, 208947025, 6018764552, 220642515076, 8323556149400, 385679126851225, 18298351908731960, 1039016878950507076, 60196918693633189580, 4091835726607570472281, 283040172741877232421150
Offset: 1

Views

Author

R. H. Hardin, Feb 21 2012

Keywords

Comments

Diagonal of A207949.

Examples

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

Crossrefs

Cf. A207949.