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.

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

Original entry on oeis.org

16, 232, 3968, 63488, 1048576, 16776896, 268369920, 4294961152, 68702608704, 1099511627776, 17592160878592, 281474976700416, 4503599627370496
Offset: 1

Views

Author

R. H. Hardin Feb 18 2013

Keywords

Comments

Row 4 of A222386

Examples

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