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.

A220583 Equals one maps: number of 5Xn binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 5Xn array.

Original entry on oeis.org

1, 512, 1487, 205323, 3162375, 106841503, 2449921734, 65126683335
Offset: 1

Views

Author

R. H. Hardin Dec 16 2012

Keywords

Comments

Row 5 of A220579

Examples

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