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.

A220802 Sum of neighbor maps: number of nX3 binary arrays indicating the locations of corresponding elements equal to the sum mod 4 of their horizontal and vertical neighbors in a random 0..3 nX3 array.

Original entry on oeis.org

8, 48, 512, 4096, 30766, 262144, 2097152, 16728064, 134217728, 1073741824, 8587150368, 68719476736, 549755813888, 4397962625024, 35184372088832, 281474976710656, 2251796346117248, 18014398509481984, 144115188075855872
Offset: 1

Views

Author

R. H. Hardin Dec 21 2012

Keywords

Comments

Column 3 of A220805

Examples

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