|
%I #5 Mar 31 2012 12:36:03
%S 26784,1151346,48744342,2171002788,95851024672,4212755548948,
%T 184696487434352,8130440303768416,357605861336206826,
%U 15723990359863559644,691174683753522142476,30395002285452611004698
%N Number of (n+1)X5 0..2 arrays with no 2X2 subblock sum equal to any horizontal or vertical neighbor 2X2 subblock sum
%C Column 4 of A185777
%H R. H. Hardin, <a href="/A185774/b185774.txt">Table of n, a(n) for n = 1..39</a>
%e Some solutions for 3X5
%e ..0..1..0..1..0....0..0..0..0..1....0..1..2..2..2....0..2..2..1..1
%e ..0..1..2..2..0....0..2..2..0..2....0..0..2..1..1....0..0..1..0..1
%e ..1..2..1..2..0....0..1..1..2..0....1..1..1..2..1....1..0..2..2..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 03 2011
| 