%I #5 Mar 31 2012 12:37:02
%S 153711850,304865717,327968423,774393122,1139760144,1719348416,
%T 9620299328,81184579243,606122835152,4770658099472,36670194434029,
%U 269385186521216,2109808033784128,16211635789930370,119093074670884992
%N Number of (n+2)X8 0..2 arrays with every 3X3 subblock having three strictly increasing elements in a row horizontally, vertically or nwtose diagonally exactly one way
%C Column 6 of A204607
%H R. H. Hardin, <a href="/A204605/b204605.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 442*a(n3) +43*a(n6) for n>17
%e Some solutions for n=3
%e ..2..2..1..0..1..0..0..2....0..0..2..1..0..2..0..0....1..1..0..1..2..1..0..0
%e ..1..1..2..1..0..0..1..0....2..1..0..0..1..0..1..1....0..1..2..0..1..2..0..1
%e ..0..1..2..2..1..0..2..1....2..2..1..0..2..1..0..2....2..0..1..2..0..1..2..2
%e ..0..0..1..2..2..1..2..2....2..2..2..1..0..2..1..1....2..2..0..1..2..0..1..2
%e ..0..1..0..1..2..2..0..2....0..1..2..2..1..2..2..1....0..1..2..0..1..2..0..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 17 2012
