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.

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

Original entry on oeis.org

12, 792, 48298, 2890017, 172905144, 10344276279, 618825190371, 37018574118868, 2214457259485909, 132469006243923162, 7924304243009714341, 474032340904538992523, 28356641623302251544461
Offset: 1

Views

Author

R. H. Hardin Jan 09 2013

Keywords

Comments

Column 6 of A221290

Examples

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