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 #3 Oct 17 2012 12:45:43
%S 25,729,19665,531143,14345273,387332417,10458051407,282370309597,
%T 7624012293659,205848628366997,5557913837745823,150063732111219045,
%U 4051720943493086779,109396471194812694909
%N Number of nX3 arrays of the minimum or maximum value of corresponding elements and their horizontal and vertical neighbors in a random 0..2 nX3 array
%C Column 3 of A217999
%e Some solutions for n=3
%e ..0..1..0....0..0..1....1..2..0....2..1..2....1..2..0....2..2..1....2..0..2
%e ..0..2..2....1..2..1....1..2..0....0..0..1....2..2..2....2..1..2....0..1..1
%e ..1..1..1....1..1..0....1..1..0....2..0..0....0..0..2....2..2..2....0..0..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Oct 17 2012