%I #5 Mar 31 2012 12:37:09
%S 7878,103194,1967814,38532894,759076386,14970344658,295275611838,
%T 5823726851622,114855474850530,2265100634575482,44669845159506126,
%U 880919674587106662,17372218977042484098,342588405720989078730
%N Number of (n+1)X6 0..2 arrays with every 2X3 or 3X2 subblock having exactly three clockwise edge increases
%C Column 5 of A206072
%H R. H. Hardin, <a href="/A206069/b206069.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 50*a(n-1) -967*a(n-2) +9758*a(n-3) -58681*a(n-4) +225870*a(n-5) -576896*a(n-6) +980296*a(n-7) -1057712*a(n-8) +604854*a(n-9) +7921*a(n-10) -283098*a(n-11) +215171*a(n-12) -85894*a(n-13) +23942*a(n-14) -5340*a(n-15) +663*a(n-16) for n>21
%e Some solutions for n=4
%e ..1..2..0..2..1..1....2..1..1..0..2..1....1..0..0..1..0..0....1..0..1..1..0..1
%e ..2..1..2..1..0..2....1..0..2..1..0..2....0..2..1..0..2..1....2..1..0..2..1..2
%e ..1..2..0..2..1..0....0..1..0..2..1..0....2..0..2..1..0..2....1..2..1..0..2..0
%e ..1..0..1..0..2..1....0..2..1..0..2..1....0..1..0..2..1..0....1..0..2..1..0..1
%e ..2..1..0..1..0..2....1..0..2..1..0..2....0..2..1..0..2..1....0..2..0..2..1..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 03 2012
|