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.

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

Original entry on oeis.org

1, 32, 91, 1441, 8334, 64497, 436288, 3036588, 21023792, 146254012, 1011489196, 7016643627, 48603225482, 336693889957, 2332461879768, 16156948253940, 111913294295697, 775187951935208, 5369332881497134, 37190288381188178
Offset: 1

Views

Author

R. H. Hardin Dec 16 2012

Keywords

Comments

Row 3 of A220579

Examples

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