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.

A221288 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..3 nX5 array.

Original entry on oeis.org

7, 200, 5912, 172904, 4983598, 143511784, 4129628435, 118813480496, 3418203388701, 98338490101681, 2829094038032543, 81389941488977962, 2341498869979723606, 67362334665049967042, 1937939871911867309221
Offset: 1

Views

Author

R. H. Hardin Jan 09 2013

Keywords

Comments

Column 5 of A221290

Examples

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