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.

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

Original entry on oeis.org

2, 8, 512, 65536, 17530176, 68719476736, 562949953421312
Offset: 1

Views

Author

R. H. Hardin Dec 31 2012

Keywords

Comments

Diagonal of A221072

Examples

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