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.

A220934 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..2 nX5 array.

Original entry on oeis.org

7, 200, 5912, 172904, 4983202, 143495572, 4129000493, 118791182035, 3417440488681, 98313052773312, 2828261800424005, 81363108971612428, 2340643785326878730, 67335342944117783361, 1937094540263542667587
Offset: 1

Views

Author

R. H. Hardin Dec 25 2012

Keywords

Comments

Column 5 of A220935

Examples

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