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.

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

Original entry on oeis.org

2, 16, 82, 611, 5904, 45520, 467686, 4556171, 48655983, 567847595, 6351729691, 80023297510, 1005050679531, 12834603243934, 174354454607454, 2353308940308585, 32870079608035300, 470039857440029540
Offset: 1

Views

Author

R. H. Hardin Feb 16 2012

Keywords

Comments

Diagonal of A207269

Examples

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