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.

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

Original entry on oeis.org

2, 16, 90, 760, 5200, 46956, 370734, 3599104, 31807710, 329885620, 3198732768, 35206521816, 369188811082, 4287997640080, 48104913781890, 586813738039904, 6984278125524784, 89124296743065348, 1118012637781250310
Offset: 1

Views

Author

R. H. Hardin Feb 17 2012

Keywords

Comments

Diagonal of A207453

Examples

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