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.

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

Original entry on oeis.org

2, 16, 98, 1307, 21517, 491948, 16675001, 760840082, 48694010408, 4485988205726, 562936265068141, 102307352557957161, 26014225086453944774, 9391676528481972080755, 4844995109176631213739332
Offset: 1

Views

Author

R. H. Hardin Feb 18 2012

Keywords

Comments

Diagonal of A207467

Examples

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