|
%I #4 Mar 31 2012 12:36:55
%S 16,88,12,776,760,16104,120260,287100,12080288,2926632,1009513332,
%T 1912765380,57534385968,579172984788,1927759303016
%N Number of nX2 0..3 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
%C Column 2 of A203252
%e Some solutions for n=3
%e ..1..3....0..1....2..3....3..2....0..0....3..1....0..2....0..0....3..3....3..3
%e ..0..3....0..3....0..3....3..0....1..2....3..0....0..3....2..1....2..1....1..2
%e ..0..2....2..3....0..1....1..0....3..3....2..0....1..3....3..3....0..0....0..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Dec 30 2011
| 