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 #9 Mar 02 2018 11:27:16
%S 2,14,113,953,8037,67774,571530,4819638,40643380,342740340,2890284724,
%T 24373395288,205537673480,1733272476824,14616461440144,
%U 123258718919184,1039424750772560,8765333779162336,73916920107029408,623331776719986016
%N Number of n X 2 0..2 arrays with values 0..2 introduced in row major order and each element equal to no more than two horizontal and vertical neighbors.
%C Column 2 of A199655.
%H R. H. Hardin, <a href="/A199649/b199649.txt">Table of n, a(n) for n = 1..200</a>
%F Empirical: a(n) = 8*a(n-1) + 4*a(n-2) - 2*a(n-3) - 8*a(n-4) for n>6.
%F Empirical g.f.: x*(2 - 2*x - 7*x^2 - 3*x^3 + 5*x^4 + 4*x^5) / (1 - 8*x - 4*x^2 + 2*x^3 + 8*x^4). - _Colin Barker_, Mar 02 2018
%e Some solutions for n=3:
%e ..0..1....0..0....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..0
%e ..0..2....1..1....2..2....0..1....1..2....2..0....0..1....2..2....0..2....1..0
%e ..1..2....2..1....0..0....2..1....1..2....1..2....0..2....0..2....2..0....1..0
%Y Cf. A199655.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 08 2011