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.

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

Original entry on oeis.org

2, 16, 102, 1369, 44121, 2934369, 298294290, 56804048896, 22612514662790, 17183745725983369, 23510773704878179041, 60748271137827940655041, 304386527035085508883292036, 2891218911926091087027201634564
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Diagonal of A207858

Examples

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