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.

A208366 Number of nX5 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 0 1 0 vertically.

Original entry on oeis.org

16, 256, 1644, 9999, 67396, 422541, 2563359, 15730896, 96081144, 582174000, 3527156073, 21366154944, 129224742827, 781136134575, 4721445779732, 28529589334000, 172355128544728, 1041178745668425, 6289245172035000
Offset: 1

Views

Author

R. H. Hardin Feb 25 2012

Keywords

Comments

Column 5 of A208369

Examples

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