|
%I #5 Mar 31 2012 12:37:01
%S 254913953,395943745,422397021,1122887052,1364559057,2050960896,
%T 13168291392,115434720000,978463169280,8406274955328,67649125363200,
%U 567027453966336,4851531476034048,39033529900574976,327172939042111488
%N Number of (n+2)X8 0..2 arrays with every 3X3 subblock having three strictly increasing elements in a row horizontally or vertically, exactly one way
%C Column 6 of A204417
%H R. H. Hardin, <a href="/A204415/b204415.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 577*a(n-3) for n>17
%e Some solutions for n=3
%e ..0..1..2..0..1..0..2..0....2..1..0..0..0..0..0..1....2..1..1..1..0..2..2..0
%e ..2..0..1..2..1..1..0..1....1..0..1..0..0..1..0..0....0..1..2..0..1..0..1..1
%e ..0..1..0..1..2..2..1..0....1..1..2..1..0..2..1..1....0..0..1..2..2..1..0..2
%e ..0..1..2..0..1..2..2..1....0..1..2..2..1..1..2..1....2..0..0..1..2..2..1..2
%e ..0..0..1..2..0..1..2..2....0..0..1..2..2..0..1..2....0..1..2..0..1..2..2..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 15 2012
| 