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.

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

Original entry on oeis.org

64, 3968, 262144, 16776896, 1073741712, 68719469568, 4398044807168, 281474968175508, 18014398509481984, 1152921504606846976, 73786976290732196864, 4722366482869645213696, 302231454903657058795520
Offset: 1

Views

Author

R. H. Hardin Feb 18 2013

Keywords

Comments

Column 6 of A222386

Examples

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