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

16, 256, 4000, 63488, 1048352, 16777216, 268435456, 4294962688, 68702699520, 1099511601152, 17592186044416, 281474976710656, 4503599627247616, 72057490958712832, 1152921504604356608, 18446744073709551616

Offset: 1

Author

R. H. Hardin Mar 09 2013

Keywords

• nonn

Comments

Column 4 of A222935

Examples

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

Links

• R. H. Hardin, Table of n, a(n) for n = 1..210

Formula

Empirical: a(n) = 16*a(n-1) +8352*a(n-5) -133632*a(n-6) -18096384*a(n-10) [phone]*a(n-11) [phone]*a(n-15) -44059590656*a(n-16) -143077146624*a(n-20) [phone]*a(n-21) [phone]*a(n-25) -44117904064512*a(n-26) -17592186044416*a(n-30) [phone]*a(n-31)