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 #7 Jul 23 2018 13:48:20
%S 9,91,835,7765,72257,672627,6261827,58295677,542717361,5052561371,
%T 47038082435,437912812805,4076859114817,37954542163107,
%U 353347327405987,3289575547592237,30625128435267441,285112312553286091
%N Number of n X 3 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..2 n X 3 array.
%C Column 3 of A217964.
%H R. H. Hardin, <a href="/A217959/b217959.txt">Table of n, a(n) for n = 1..181</a>
%F Empirical: a(n) = 10*a(n-1) - 4*a(n-2) - 20*a(n-3) - 23*a(n-4) - 10*a(n-5).
%F Empirical g.f.: x*(9 + x - 39*x^2 - 41*x^3 - 26*x^4) / (1 - 10*x + 4*x^2 + 20*x^3 + 23*x^4 + 10*x^5). - _Colin Barker_, Jul 23 2018
%e Some solutions for n=3:
%e ..1..0..1....2..1..1....1..0..0....0..0..1....2..0..1....2..0..0....0..0..0
%e ..0..0..2....1..0..0....1..0..0....1..1..2....0..0..2....2..0..0....1..0..1
%e ..1..1..2....1..0..0....1..0..2....1..1..2....0..0..0....1..0..2....1..0..0
%Y Cf. A217964.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 16 2012