%I #5 Mar 31 2012 12:37:02
%S 328845,741296,981914,5260434,43980907,327968423,2572437376,
%T 19830769591,145914949262,1140444970482,8787545915342,64670009972489,
%U 505434059501614,3894123049686996,28662130896313045,224003467472538457
%N Number of (n+2)X5 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 3 of A204607
%H R. H. Hardin, <a href="/A204602/b204602.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 442*a(n3) +63*a(n5) +43*a(n6) 63*a(n8) +81*a(n9) 81*a(n12) for n>20
%e Some solutions for n=3
%e ..1..1..0..0..1....1..0..0..0..1....2..2..1..1..0....2..0..0..0..2
%e ..0..1..0..1..0....1..0..1..0..1....1..0..1..2..1....1..1..1..0..2
%e ..0..1..2..2..1....2..0..2..1..0....0..1..2..1..2....1..0..2..1..0
%e ..0..0..1..2..2....0..1..2..2..1....1..0..0..1..2....0..1..2..2..1
%e ..0..2..0..1..2....2..0..1..2..2....0..0..1..2..1....1..0..1..2..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 17 2012
