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.

A220251 Sum of neighbor maps: number of nX3 binary arrays indicating the locations of corresponding elements equal to the sum mod 3 of their king-move neighbors in a random 0..2 nX3 array.

Original entry on oeis.org

8, 48, 324, 4096, 31744, 262144, 2011776, 16728064, 134217728, 1073741824, 8557195616, 68719476736, 549755813888, 4397962625024, 35175111229440, 281474976710656, 2251796592459776, 18014398509481984, 144112331924652032
Offset: 1

Views

Author

R. H. Hardin Dec 08 2012

Keywords

Comments

Column 3 of A220254

Examples

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