%I #5 Mar 31 2012 12:37:06
%S 256,1976,15616,124048,986388,7854572,62623348,499915248,3995675256,
%T 31974871096,256177589404,2054827670052,16500568550588,
%U 132647236063288,1067478673720944,8599383059167200,69343765363020324,559711476205611868
%N Number of (n+1)X2 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock the same
%C Column 1 of A205370
%H R. H. Hardin, <a href="/A205363/b205363.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 16*a(n-1) -63*a(n-2) -27*a(n-3) +182*a(n-4) -217*a(n-5) +114*a(n-6) -4*a(n-7) -4*a(n-8) +4*a(n-9) for n>10
%e Some solutions for n=4
%e ..1..3....3..3....0..2....0..2....0..2....0..3....3..3....1..0....0..3....3..0
%e ..2..3....0..0....0..3....2..1....0..1....0..0....0..1....2..3....2..2....1..2
%e ..2..2....2..2....1..0....1..0....0..0....1..1....0..0....2..2....1..2....0..0
%e ..1..2....3..2....2..1....2..1....0..1....1..3....1..1....1..1....1..1....2..1
%e ..1..2....0..1....3..2....3..2....0..0....3..3....1..3....3..3....3..3....3..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 26 2012