|
%I #5 Mar 31 2012 12:37:01
%S 2004465237,2826265830,3619976949,6016853259,8802512928,13168291392,
%T 27153833472,206114865408,2587131767808,13862829908736,
%U 122134679546112,1514872207710720,8036997091598592,70505197603909632,874092505119473664
%N Number of (n+2)X9 0..2 arrays with every 3X3 subblock having three strictly increasing elements in a row horizontally or vertically, exactly one way
%C Column 7 of A204417
%H R. H. Hardin, <a href="/A204416/b204416.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 577*a(n-3) for n>18
%e Some solutions for n=3
%e ..1..2..1..1..0..2..2..0..2....0..1..0..1..1..0..1..1..0
%e ..0..1..2..0..1..0..1..1..0....0..1..1..0..2..1..0..2..1
%e ..2..0..1..2..2..1..0..2..1....0..0..2..1..0..2..1..0..2
%e ..2..2..0..1..2..2..1..0..2....0..1..2..2..1..2..2..1..0
%e ..0..1..2..0..1..2..2..1..0....1..0..1..2..2..1..0..2..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 15 2012
| 