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 #8 Mar 05 2018 11:26:14
%S 6,36,114,450,1644,6186,23010,85992,320742,1197318,4467984,16675494,
%T 62232582,232257108,866792178,3234917538,12072868380,45056571498,
%U 168153392514,627557039160,2342074698438,8740741860870,32620892573088
%N Number of 3 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 0 vertically.
%C Row 3 of A207717.
%H R. H. Hardin, <a href="/A207718/b207718.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 2*a(n-1) + 7*a(n-2) - a(n-3) - 4*a(n-4) + a(n-5).
%F Empirical g.f.: 6*x*(1 + 4*x - 4*x^3 + x^4) / ((1 + x)*(1 - 4*x + x^2)*(1 + x - x^2)). - _Colin Barker_, Mar 05 2018
%e Some solutions for n=4:
%e ..0..1..0..0....1..1..1..1....1..1..1..0....1..1..0..1....1..1..0..1
%e ..0..1..1..0....1..1..1..1....0..1..1..0....0..1..0..0....0..1..1..0
%e ..0..1..1..0....1..1..1..0....1..0..1..0....1..1..0..1....1..1..0..1
%Y Cf. A207717.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 19 2012