%I #5 Mar 31 2012 12:37:02
%S 2275645,4820300,5260434,10978524,69792825,774393122,4518555426,
%T 32448416953,349259705982,2010484777666,14354494409473,
%U 154409289786362,888816408342414,6346077122217149,68263874184421262,392943303332786626
%N Number of (n+2)X6 0..2 arrays with every 3X3 subblock having three strictly increasing elements in a row horizontally, vertically or nw-to-se diagonally exactly one way
%C Column 4 of A204607
%H R. H. Hardin, <a href="/A204603/b204603.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 442*a(n-3) +43*a(n-6) for n>15
%e Some solutions for n=3
%e ..2..0..0..0..2..1....2..2..1..2..0..1....2..2..2..2..0..2....0..2..1..2..2..0
%e ..1..1..1..0..1..0....0..1..2..0..1..0....0..1..2..1..1..0....1..0..1..2..1..1
%e ..0..0..2..1..0..2....1..0..1..2..2..1....0..0..1..2..2..1....2..2..0..1..2..2
%e ..0..1..2..2..1..1....0..2..0..1..2..2....0..1..0..1..2..2....0..1..2..0..1..2
%e ..1..0..1..2..2..2....0..1..2..0..1..2....1..0..2..0..1..2....1..0..1..2..2..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 17 2012