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.

A222937 Sum of neighbor maps: number of 3Xn 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 3Xn array.

Original entry on oeis.org

8, 64, 512, 4000, 32760, 262104, 2097152, 16777216, 134217728, 1073741824, 8589499198, 68719476736, 549755813888, 4398046511104, 35184372088832, 281474975268864, 2251799813683712, 18014398509056000, 144115188075855872
Offset: 1

Views

Author

R. H. Hardin Mar 09 2013

Keywords

Comments

Row 3 of A222935

Examples

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