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.

A220172 Sum of neighbor maps: number of n X 1 binary arrays indicating the locations of corresponding elements equal to the sum mod 3 of their horizontal, vertical and antidiagonal neighbors in a random 0..2 n X 1 array.

Original entry on oeis.org

2, 2, 8, 16, 24, 64, 128, 232, 512, 1024, 1984, 4096, 8192, 16224, 32768, 65536, 130688, 262144, 524288, 1047680, 2097152, 4194304, 8386560, 16777216, 33554432, 67104256, 134217728, 268435456, 536860672, 1073741824, 2147483648, 4294944768
Offset: 1

Views

Author

R. H. Hardin, Dec 06 2012

Keywords

Comments

Column 1 of A220177.

Examples

			All solutions for n=3:
..1....0....1....1....0....0....0....1
..1....1....0....1....0....0....1....0
..0....0....1....1....0....1....1....0
		

Formula

Empirical: a(n) = 2*a(n-1) +4*a(n-3) -8*a(n-4) -4*a(n-6) +8*a(n-7).
Empirical g.f.: 2*(1 - x + 2*x^2 - 4*x^3 + 4*x^6) / ((1 - 2*x)*(1 - 2*x^3)^2). - Colin Barker, Feb 18 2018