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.

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

Original entry on oeis.org

1, 12, 92, 572, 4062, 29467, 213225, 1540686, 11163495, 80656708, 581473349, 4190483128, 30199355040, 217538559602, 1566825952174, 11283025994195, 81236036737903, 584831754731217, 4210022381269251, 30304818855812080
Offset: 1

Views

Author

R. H. Hardin Dec 10 2012

Keywords

Comments

Row 3 of A220328

Examples

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