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.

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

Original entry on oeis.org

16, 232, 4096, 63488, 1047664, 16776992, 268435456, 4294967296, 68702202624, 1099511627776, 17592186044416, 281474975006720, 4503599620030464, 72057490958712832, 1152921504606846976, 18446744073700638720
Offset: 1

Views

Author

R. H. Hardin Mar 09 2013

Keywords

Comments

Row 4 of A222935

Examples

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