|
%I #5 Dec 05 2012 05:37:22
%S 4,16,56,250,984,3888,15798,63092,252064,1010554,4040556,16155482,
%T 64620946,258358476,1032891644,4129483594,16508060352,65991303276,
%U 263798841494,1054506124776,4215228829600,16849633947562,67352986553090
%N Number of nX1 arrays of the minimum or maximum value of corresponding elements and their horizontal and vertical neighbors in a random 0..3 nX1 array
%C Column 1 of A220109
%H R. H. Hardin, <a href="/A220106/b220106.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 4*a(n-1) +2*a(n-2) +3*a(n-3) -32*a(n-4) -34*a(n-5) -23*a(n-6) -158*a(n-7) +295*a(n-9) +42*a(n-10) -65*a(n-11) +12*a(n-12) -44*a(n-13) +2*a(n-14) +24*a(n-15)
%e Some solutions for n=3
%e ..1....2....3....0....0....0....0....2....1....1....3....3....1....3....2....0
%e ..1....0....1....0....2....3....1....0....0....1....2....3....3....0....1....3
%e ..2....3....3....2....1....3....0....1....3....1....3....3....2....2....1....2
%K nonn
%O 1,1
%A _R. H. Hardin_ Dec 05 2012
| 