|
%I #5 Mar 31 2012 12:36:57
%S 3,9,18,26,26,12,98,366,796,996,534,5366,23308,56516,75120,41600,
%T 448400,2053480,5180820,7049350,3952950,44504530,210527016,543851924,
%U 750110424,423385872,4900761656,23667951384,62074790736,86372858208,48953570736
%N Number of nX1 0..2 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
%C Column 1 of A203600
%H R. H. Hardin, <a href="/A203594/b203594.txt">Table of n, a(n) for n = 1..86</a>
%e Some solutions for n=4
%e ..1....0....1....1....2....1....1....2....0....1....0....1....2....0....2....1
%e ..0....0....2....0....2....0....0....2....0....1....1....2....1....1....0....1
%e ..0....2....0....0....0....0....0....1....1....0....2....2....0....2....1....2
%e ..2....2....1....2....0....2....2....1....2....0....0....0....2....0....2....2
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 03 2012
|
