|
%I #5 Mar 31 2012 12:37:01
%S 34274,154938,781884,5597126,52039032,395943745,2826265830,
%T 26252359826,205479237126,1502458946249,13958434142795,
%U 110683258435601,818759240142934,7569154327184004,60474302014382768,450620436164601198
%N Number of (n+2)X4 0..2 arrays with every 3X3 subblock having three strictly increasing elements in a row horizontally or vertically, exactly one way
%C Column 2 of A204417
%H R. H. Hardin, <a href="/A204411/b204411.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 737*a(n-3) +135*a(n-4) +564*a(n-5) -109084*a(n-6) -27511*a(n-7) -186930*a(n-8) -429594*a(n-9) -166223*a(n-10) +2117595*a(n-11) +208279*a(n-12) +1766751*a(n-13) +6306642*a(n-14) +17530589*a(n-15) +9984342*a(n-16) -3716271*a(n-17) -2952990*a(n-18) +123210*a(n-19) for n>22
%e Some solutions for n=3
%e ..0..0..0..0....1..0..1..2....0..1..2..0....0..2..2..0....1..0..2..2
%e ..0..0..0..1....2..0..2..0....2..2..0..1....0..1..2..0....1..1..1..0
%e ..0..1..2..2....0..1..2..0....0..1..1..2....0..0..1..2....2..2..0..1
%e ..1..0..1..2....0..0..1..2....1..1..2..2....1..1..0..1....0..1..2..2
%e ..0..2..1..2....1..2..0..2....2..0..1..2....2..0..0..0....0..0..1..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 15 2012
| 