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.

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

Original entry on oeis.org

16, 371, 8334, 165130, 3162375, 59690533, 1120269376, 20961430054, 391477041024, 7301113014734, 136014086356403, 2531419892514045, 47074407789101798, 874763025888567980, 16244954731049984109, 301509938118179385606
Offset: 1

Views

Author

R. H. Hardin Dec 16 2012

Keywords

Comments

Column 5 of A220579

Examples

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