|
%I #5 Mar 31 2012 12:36:57
%S 9,16,46,16,596,936,5326,64452,35472,2267096,6154424,36768700,
%T 493844572,304850530,19837028156,60734482172,379565828184,
%U 5278506424584,3491085331400,230590641604648,737735394947292,4754537676837632
%N Number of nX2 0..2 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
%C Column 2 of A203600
%H R. H. Hardin, <a href="/A203595/b203595.txt">Table of n, a(n) for n = 1..26</a>
%e Some solutions for n=5
%e ..1..2....0..1....2..0....2..2....2..2....2..1....1..0....1..2....0..2....2..2
%e ..2..2....0..2....1..0....2..0....2..1....2..0....2..2....0..2....1..2....1..2
%e ..0..2....0..2....2..0....1..0....0..0....2..0....0..2....0..2....2..2....1..2
%e ..1..0....0..2....2..1....0..0....1..0....2..0....0..1....1..2....1..0....0..0
%e ..0..0....1..2....2..0....1..2....2..2....1..0....0..0....0..0....0..0....0..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 03 2012
| 