|
%I #4 Mar 31 2012 12:36:55
%S 116,776,18440,753168,50071584
%N Number of nX4 0..3 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
%C Column 4 of A203252
%e Some solutions for n=3
%e ..3..0..0..0....0..0..0..0....3..3..3..1....3..2..2..3....1..1..0..0
%e ..2..1..1..1....2..1..1..1....0..2..0..0....3..1..0..3....0..3..3..2
%e ..3..3..3..1....3..3..3..2....0..2..3..1....2..0..0..3....0..3..2..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Dec 30 2011
| 