|
%I #5 Mar 31 2012 12:37:09
%S 92,498,2712,14866,81278,445352,2436706,13344256,73036756,399888660,
%T 2188990738,11984113612,65604360312,359154388466,1966148397354,
%U 10763651700178,58924772138404,322581389428372,1765951542920976
%N Number of (n+1)X3 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two, and every 2X2 determinant nonzero
%C Column 2 of A205998
%H R. H. Hardin, <a href="/A205992/b205992.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 3*a(n-1) +17*a(n-2) -19*a(n-3) -4*a(n-4) +27*a(n-5) -13*a(n-6) +8*a(n-8) -4*a(n-9) for n>10
%e Some solutions for n=4
%e ..2..0..2....2..1..1....2..2..0....2..1..0....1..1..2....2..1..0....1..2..0
%e ..2..1..0....1..0..2....1..0..1....0..2..1....0..2..0....0..2..1....0..2..1
%e ..0..2..1....2..1..0....2..1..0....1..0..2....1..0..1....2..1..0....1..0..2
%e ..2..0..2....0..2..1....1..0..1....2..1..0....0..1..0....1..2..1....2..1..0
%e ..2..1..0....1..0..2....0..2..2....0..2..1....2..0..1....2..0..2....0..2..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 02 2012
| 