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.

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

Original entry on oeis.org

2, 16, 84, 828, 11950, 195160, 6513576, 364308938, 15284596082, 2700018736020, 787454317079753, 72216754252055376, 73270546375550142283, 119728540088330705652453, 22114539991379386419299095
Offset: 1

Views

Author

R. H. Hardin Feb 20 2012

Keywords

Comments

Diagonal of A207774

Examples

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