|
%I #5 Mar 31 2012 12:36:05
%S 256,3692,3692,53462,177828,53462,773776,8615618,8615618,773776,
%T 11199932,417088596,1399352132,417088596,11199932,162110182,
%U 20193981078,227037055176,227037055176,20193981078,162110182,2346415828,977699814950
%N T(n,k)=Number of (n+1)X(k+1) 0..3 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 Table starts
%C ........256.........3692..........53462..........773776.......11199932
%C .......3692.......177828........8615618.......417088596....20193981078
%C ......53462......8615618.....1399352132....227037055176.36842307067194
%C .....773776....417088596...227037055176.123423436053052
%C ...11199932..20193981078.36842307067194
%C ..162110182.977699814950
%C .2346415828
%H R. H. Hardin, <a href="/A186200/b186200.txt">Table of n, a(n) for n = 1..31</a>
%e Some solutions for 4X3
%e ..0..0..0....0..0..0....0..0..0....0..0..0....0..0..0....0..0..0....0..0..0
%e ..0..0..2....2..0..0....3..0..2....2..1..2....3..0..3....0..0..3....0..2..2
%e ..3..1..0....1..2..0....0..0..2....0..2..2....3..3..2....0..3..3....0..3..0
%e ..3..2..1....2..3..0....1..1..1....3..0..2....1..2..1....1..1..3....2..0..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Feb 14 2011
| 