The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #5 Mar 31 2012 12:35:55
%S 81,459,2601,15759,95481,586791,3606201,22235391,137100681,845893287,
%T 5219051049,32205712671,198734965209,1226388884391,7568017506009,
%U 46702383172479,288201314579049,1778498201192679,10975161082334409
%N Number of (n+1)X2 0..2 arrays with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one
%C Column 1 of A183971
%H R. H. Hardin, <a href="/A183963/b183963.txt">Table of n, a(n) for n = 1..200</a>
%F Empirical: a(n)=6*a(n-1)+6*a(n-3)+81*a(n-4)-468*a(n-5)-72*a(n-6)-432*a(n-8)+1728*a(n-9)
%e Some solutions for 3X2
%e ..2..1....1..1....0..2....0..2....1..2....1..0....2..0....0..1....2..1....0..0
%e ..2..1....0..0....2..2....1..1....2..0....0..1....1..0....1..0....1..2....0..0
%e ..2..1....0..1....1..2....0..2....0..2....0..1....1..0....1..1....2..2....0..1
%e ...
%e ...6.......2.......6.......4.......5.......2.......3.......2.......6.......0...
%e ...6.......1.......7.......4.......4.......2.......2.......3.......7.......1...
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 08 2011