|
%I #5 Mar 31 2012 12:37:06
%S 360,2412,17166,122232,864948,6127554,43434216,307791390,2181099672,
%T 15456520254,109532942598,776204639616,5500580033478,38979904487142,
%U 276231336095166,1957515179621772,13871944501198614,98303626985179020
%N Number of (n+1)X3 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock differing from each horizontal or vertical neighbor
%C Column 2 of A205520
%H R. H. Hardin, <a href="/A205514/b205514.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 4*a(n-1) +12*a(n-2) +59*a(n-3) +73*a(n-4) +36*a(n-5) -15*a(n-6) -32*a(n-7) -24*a(n-8) -8*a(n-9) +2*a(n-10)
%e Some solutions for n=4
%e ..2..1..2....2..2..2....2..2..2....2..0..2....0..2..2....2..1..2....1..0..2
%e ..2..1..0....1..2..2....1..2..2....1..1..1....2..1..1....1..2..2....1..1..0
%e ..0..2..2....0..2..0....2..1..2....1..0..2....0..0..2....1..2..2....0..2..2
%e ..1..1..0....0..0..2....1..1..0....2..1..1....0..0..0....2..0..2....1..1..0
%e ..1..1..2....2..1..2....0..2..2....0..0..2....1..2..1....2..2..0....0..2..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 28 2012
| 