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 Aug 11 2018 13:09:33
%S 1,17,105,783,5622,40608,293084,2115379,15268366,110202874,795416273,
%T 5741108247,41437835079,299087573904,2158736742330,15581203397143,
%U 112461095655909,811715097631008,5858749604657939,42286939137094085
%N Number of 2 X n arrays of occupancy after each element stays put or moves to some horizontal or antidiagonal neighbor, without move-in move-out straight through or left turns.
%C Row 2 of A221937.
%H R. H. Hardin, <a href="/A221938/b221938.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 3*a(n-1) + 25*a(n-2) + 40*a(n-3) + a(n-4) - 42*a(n-5) - 20*a(n-6) + 10*a(n-7) + 4*a(n-8) -a(n-9).
%F Empirical g.f.: x*(1 + 14*x + 29*x^2 + 3*x^3 - 33*x^4 - 8*x^5 + 19*x^6 + 4*x^7 - x^8) / (1 - 3*x - 25*x^2 - 40*x^3 - x^4 + 42*x^5 + 20*x^6 - 10*x^7 - 4*x^8 + x^9). - _Colin Barker_, Aug 11 2018
%e Some solutions for n=3:
%e ..0..4..0....1..2..0....1..0..2....2..0..0....0..3..0....0..3..2....0..3..1
%e ..0..2..0....0..2..1....1..2..0....0..3..1....2..0..1....0..0..1....0..1..1
%Y Cf. A221937.
%K nonn
%O 1,2
%A _R. H. Hardin_, Feb 01 2013