|
%I #5 Mar 31 2012 12:37:10
%S 960,13672,187144,2567488,35195768,482548752,6615795040,90703800392,
%T 1243565136120,17049501235304,233751713986960,3204777864965096,
%U 43938078463070080,602398924621561376,8258997140090964632
%N Number of (n+1)X3 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one
%C Column 2 of A206085
%H R. H. Hardin, <a href="/A206079/b206079.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 15*a(n-1) -14*a(n-2) -61*a(n-3) +154*a(n-4) -152*a(n-5) +198*a(n-6) -166*a(n-7) +64*a(n-8) -28*a(n-9) +8*a(n-10)
%e Some solutions for n=4
%e ..3..2..2....2..3..1....2..1..3....1..3..0....3..0..1....2..0..1....0..0..1
%e ..1..1..2....3..3..3....2..2..2....1..3..0....3..0..1....2..0..0....3..0..0
%e ..2..1..1....1..1..3....2..3..2....1..3..0....3..0..1....2..2..2....0..0..1
%e ..1..1..2....2..1..1....2..3..1....3..3..3....3..0..0....0..2..3....2..0..0
%e ..0..1..1....3..3..1....2..3..3....3..2..2....3..3..3....1..2..2....2..2..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 03 2012
| 