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.

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

Original entry on oeis.org

1, 37, 508, 6657, 92093, 1335202, 18836493, 265346645, 3750121527
Offset: 1

Views

Author

R. H. Hardin, Dec 10 2012

Keywords

Comments

Row 4 of A220328.

Examples

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

Crossrefs

Cf. A220328.