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.

A222445 Sum of neighbor maps: number of nX2 binary arrays indicating the locations of corresponding elements equal to the sum mod 4 of their horizontal, vertical and antidiagonal neighbors in a random 0..3 nX2 array.

Original entry on oeis.org

2, 14, 64, 210, 1024, 4000, 16288, 65536, 260080, 1048576, 4191744, 16774656, 67108864, 268379104, 1073741824, 4294909952, 17179811840, 68719476736, 274876642816, 1099511627776, 4398045331456, 17592184864768, 70368744177664
Offset: 1

Views

Author

R. H. Hardin Feb 20 2013

Keywords

Comments

Column 2 of A222448

Examples

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

Formula

Empirical: a(n) = 4*a(n-1) +60*a(n-5) -240*a(n-6) -1456*a(n-10) +5824*a(n-11) +18496*a(n-15) -73984*a(n-16) -133120*a(n-20) +532480*a(n-21) +544768*a(n-25) -2179072*a(n-26) -1179648*a(n-30) +4718592*a(n-31) +1048576*a(n-35) -4194304*a(n-36)