|
%I #5 Mar 31 2012 12:36:04
%S 38700,4004914,420747588,44035074450,4616697253366,483841012308074,
%T 50708343182050686,5314583162402080764,556996994809290806116,
%U 58376500307514923634414,6118192490159262325715702
%N Number of (n+1)X5 0..2 arrays with no 2X2 subblock diagonal sum less antidiagonal sum equal to any horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum
%C Column 4 of A185856
%H R. H. Hardin, <a href="/A185851/b185851.txt">Table of n, a(n) for n = 1..95</a>
%e Some solutions for 3X5
%e ..0..0..0..0..2....0..0..1..1..1....0..0..1..2..0....0..1..2..1..1
%e ..0..2..2..0..2....0..1..0..2..2....0..1..0..0..0....0..0..1..1..1
%e ..0..0..1..1..2....0..0..1..1..0....0..0..1..2..1....0..0..0..2..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 05 2011
| 