cp's OEIS Frontend

A277768 Number of 3Xn 0..2 arrays with every element equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0) both plus 1 mod 3 and minus 1 mod 3, with new values introduced in order 0..2.

%I A277768 #4 Oct 29 2016 07:31:30
%S A277768 0,2,17,204,1989,21141,220549,2292380,23911889,249253583,2597767946,
%T A277768 27078215723,282249897665,2942003150449,30665850885332,
%U A277768 319644266438138,3331797339053418,34728844714392948,361994612635214032
%N A277768 Number of 3Xn 0..2 arrays with every element equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0) both plus 1 mod 3 and minus 1 mod 3, with new values introduced in order 0..2.
%C A277768 Row 3 of A277767.
%H A277768 R. H. Hardin, <a href="/A277768/b277768.txt">Table of n, a(n) for n = 1..210</a>
%F A277768 Empirical: a(n) = 11*a(n-1) -a(n-2) +10*a(n-3) -648*a(n-4) -323*a(n-5) +2443*a(n-6) +9234*a(n-7) -2121*a(n-8) +1974*a(n-9) -6288*a(n-10) +2781*a(n-11) -4959*a(n-12) +757*a(n-13) -898*a(n-14) +2180*a(n-15) +116*a(n-16) +44*a(n-17) -288*a(n-18)
%e A277768 Some solutions for n=4
%e A277768 ..0..1..2..0. .0..1..1..0. .0..1..2..0. .0..1..0..2. .0..1..2..1
%e A277768 ..2..1..0..1. .2..2..2..2. .2..1..1..1. .2..2..2..1. .2..0..0..0
%e A277768 ..0..1..2..1. .1..0..0..1. .0..1..2..0. .0..1..0..2. .0..1..1..2
%Y A277768 Cf. A277767.
%K A277768 nonn
%O A277768 1,2
%A A277768 _R. H. Hardin_, Oct 29 2016