Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Dec 19 2012 13:00:21
%S 64,192,4328,24934,354706,2715804,31659166,277952034,2954256382,
%T 27594850862,281218334508,2702246506854,27016733242156,
%U 262977482298808,2606430063309362,25520149513177148,251935677082462500
%N Number of 3Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..3 3Xn array
%C Row 3 of A220761
%H R. H. Hardin, <a href="/A220763/b220763.txt">Table of n, a(n) for n = 1..65</a>
%e Some solutions for n=3
%e ..3..0..2....2..0..1....1..1..1....0..0..2....1..1..2....1..1..1....1..1..3
%e ..2..0..0....2..0..0....2..0..3....1..0..3....2..0..1....3..1..1....1..1..3
%e ..2..0..1....3..0..3....0..0..1....0..0..2....3..0..0....1..1..2....1..1..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Dec 19 2012