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.

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

Original entry on oeis.org

2, 16, 114, 1953, 67396, 4503765, 570085195, 146860432968, 74897509230292, 75596512299763500, 152131706172601320207, 610735743447136550959464, 4881221988286284651358877549, 77769812914565143635925340729415
Offset: 1

Views

Author

R. H. Hardin Feb 25 2012

Keywords

Comments

Diagonal of A208369

Examples

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