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.

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

Original entry on oeis.org

2, 16, 72, 420, 2176, 10660, 60984, 340816, 1846240, 11076228, 66303360, 390426916, 2456007216, 15586002640, 98058552648, 645057461220, 4299810563584, 28563593727716, 195777751059000, 1361449965542992, 9468978890210480
Offset: 1

Views

Author

R. H. Hardin Feb 25 2012

Keywords

Comments

Diagonal of A208379

Examples

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