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.

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

Original entry on oeis.org

7, 174, 4062, 92093, 2065264, 46094354, 1026529800, 22841390408, 508110710307, 11302385499363, 251409042152240, 5592331837970994, 124395540371693940, 2767041352339397099
Offset: 1

Views

Author

R. H. Hardin Dec 10 2012

Keywords

Comments

Column 5 of A220328

Examples

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