A205903 - OEIS

%I #5 Mar 31 2012 12:37:07

%S 369,2943,24045,201324,1712907,14747754,128014116,1117395426,

%T 9789931593,85987653345,756504850728,6662896047993,58725710260422,

%U 517845692413770,4567816196479464,40300129771090119,355601159005303077

%N Number of (n+1)X3 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock the same

%C Column 2 of A205909

%H R. H. Hardin, <a href="/A205903/b205903.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 17*a(n-1) -86*a(n-2) +117*a(n-3) +90*a(n-4) -446*a(n-5) +619*a(n-6) -476*a(n-7) +234*a(n-8) -92*a(n-9) +24*a(n-10) for n>11

%e Some solutions for n=4

%e ..1..2..1....2..2..1....2..1..0....2..1..2....2..0..1....2..2..1....0..1..0

%e ..2..2..0....0..1..1....0..2..1....0..2..0....0..1..2....2..0..1....0..2..1

%e ..0..0..0....0..0..0....1..0..2....2..0..1....0..2..1....2..0..1....1..0..2

%e ..2..0..1....0..1..0....0..1..0....2..1..2....1..0..2....2..0..1....0..1..0

%e ..2..0..0....0..1..1....1..0..1....0..2..0....0..1..0....2..0..1....2..2..1

%K nonn

%O 1,1

%A _R. H. Hardin_ Feb 01 2012