%I #4 Dec 30 2013 17:12:09
%S 3084,91916,2761748,83120724,2502596188,75353928188,2268967605156,
%T 68320694237108,2057200342508092,61944247178059100,
%U 1865199913242292132,56162935264244462548,1691119155959930890236,50921198959363203903516
%N Number of (n+1)X(3+1) 0..3 arrays with no adjacent elements equal and with each 2X2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases
%C Column 3 of A234786
%H R. H. Hardin, <a href="/A234781/b234781.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 45*a(n-1) -528*a(n-2) +2592*a(n-3) -5997*a(n-4) +5689*a(n-5) +812*a(n-6) -4760*a(n-7) +1942*a(n-8) +278*a(n-9) -112*a(n-10)
%e Some solutions for n=2
%e ..2..1..0..3....2..1..3..1....2..0..1..3....0..1..3..1....3..0..2..3
%e ..1..0..2..0....0..2..1..3....3..2..0..1....2..3..0..3....0..3..0..2
%e ..2..1..0..1....2..1..2..1....1..3..1..3....3..2..3..2....2..1..3..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 30 2013
|