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.

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

Original entry on oeis.org

2, 16, 102, 984, 9900, 119580, 1604862, 24229696, 403795242, 7388858420, 147219127000, 3175214941800, 73720244775658, 1833809960513104, 48667824127404150, 1372862920890984032, 41025768742532649684
Offset: 1

Views

Author

R. H. Hardin Feb 25 2012

Keywords

Comments

Diagonal of A208287

Examples

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