|
%I #5 Mar 31 2012 12:37:04
%S 243,889,4171,19151,100761,515720,2789316,14729453,79584319,424134500,
%T 2284106734,12214870500,65649772252,351622627754,1887885419556,
%U 10119043216091,54302259297443,291163602360747,1562095220381140
%N Number of (n+1)X3 0..2 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock equal to the number in all its horizontal and vertical neighbors
%C Column 2 of A205055
%H R. H. Hardin, <a href="/A205049/b205049.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 8*a(n-1) -7*a(n-2) -79*a(n-3) +307*a(n-4) -563*a(n-5) +339*a(n-6) +1297*a(n-7) -4336*a(n-8) +7348*a(n-9) -9090*a(n-10) +6883*a(n-11) +2049*a(n-12) -11926*a(n-13) +13484*a(n-14) -9334*a(n-15) +7950*a(n-16) -9011*a(n-17) +8698*a(n-18) -7986*a(n-19) +7725*a(n-20) -6101*a(n-21) +3183*a(n-22) -1053*a(n-23) +337*a(n-24) -187*a(n-25) +81*a(n-26) -16*a(n-27) +a(n-28) for n>30
%e Some solutions for n=4
%e ..1..1..0....2..2..1....0..1..2....1..1..2....2..0..1....0..2..2....0..1..2
%e ..1..2..1....2..2..0....0..1..2....0..1..1....0..1..0....0..0..1....0..1..2
%e ..0..1..2....1..0..0....2..0..2....0..0..1....1..1..2....1..0..0....1..0..1
%e ..0..1..2....1..0..0....0..1..0....2..0..0....0..2..1....1..1..0....0..2..1
%e ..0..1..2....0..0..0....2..1..2....1..1..0....2..1..2....2..1..1....1..1..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 21 2012
| 