|
%I #5 Mar 31 2012 12:37:10
%S 1012,18172,329216,5972392,108363344,1966171084,35674679732,
%T 647289744976,11744575881312,213096317372352,3866469156691484,
%U 70154115855170420,1272892598372080320,23095659424144383792,419053017449035125152
%N Number of (n+1)X3 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two
%C Column 2 of A206197
%H R. H. Hardin, <a href="/A206191/b206191.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 23*a(n-1) -97*a(n-2) +169*a(n-3) -151*a(n-4) +250*a(n-5) -178*a(n-6) +66*a(n-7) -64*a(n-8) +8*a(n-9) +4*a(n-10)
%e Some solutions for n=4
%e ..1..0..0....1..3..0....2..1..1....0..1..0....3..2..1....2..3..1....0..2..3
%e ..0..2..1....1..0..1....1..0..3....2..0..1....1..0..2....1..1..3....2..1..1
%e ..2..1..0....2..1..2....2..1..0....2..1..3....3..1..3....3..2..1....0..3..2
%e ..1..3..1....1..3..3....0..2..1....0..2..1....0..2..0....0..3..2....1..0..3
%e ..3..0..2....0..1..0....1..3..2....3..3..2....1..3..2....3..1..3....3..2..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 04 2012
| 