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.

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

Original entry on oeis.org

8, 64, 512, 3968, 32768, 262144, 2093824, 16776064, 134121152, 1073741824, 8589934592, 68719450112, 549755703296, 4398040219648, 35184371580928, 281474867658752, 2251799813685248, 18014398509481984, 144115184855048192
Offset: 1

Views

Author

R. H. Hardin Feb 18 2013

Keywords

Comments

Row 3 of A222386

Examples

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