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.

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

Original entry on oeis.org

8, 48, 512, 3772, 31744, 262144, 2097152, 16728064, 134140928, 1073741824, 8587837440, 68719476736, 549755813888, 4397939335680, 35184372088832, 281474976710656, 2251796592459776, 18014398509481984, 144115185909972992
Offset: 1

Views

Author

R. H. Hardin Jan 21 2013

Keywords

Comments

Row 3 of A221666

Examples

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