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.

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

Original entry on oeis.org

2, 16, 72, 436, 2310, 11994, 65564, 379618, 2306234, 15546084, 105736196, 882008157, 7460256028, 79554888778, 842718226878, 10871887456045, 151150820925264, 2491064356652975, 43353562677488606, 900988265135221518
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Diagonal of A207682

Examples

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