|
%I #4 Oct 31 2016 12:49:58
%S 0,12,80,1434,20663,309612,4604554,68632481,1022176517,15228316440,
%T 226848548570,3379346295547,50341485804399,749929176699858,
%U 11171570766745821,166421064692483298,2479147307681739840
%N Number of nX3 0..2 arrays with every element equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) (1,-1) or (1,0) both plus 1 mod 3 and minus 1 mod 3, with new values introduced in order 0..2.
%C Column 3 of A277788.
%H R. H. Hardin, <a href="/A277783/b277783.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 12*a(n-1) +55*a(n-2) -86*a(n-3) -1166*a(n-4) -3296*a(n-5) +6405*a(n-6) +31762*a(n-7) +62850*a(n-8) -182720*a(n-9) +47716*a(n-10) -74965*a(n-11) -16995*a(n-12) +55278*a(n-13) -16503*a(n-14) +2784*a(n-15) -82768*a(n-16) -6435*a(n-17) -13073*a(n-18) +3311*a(n-19) +3798*a(n-20) +906*a(n-21) +948*a(n-22) -524*a(n-23) for n>24
%e Some solutions for n=4
%e ..0..1..2. .0..1..1. .0..1..2. .0..1..0. .0..1..2. .0..1..0. .0..1..0
%e ..2..2..0. .2..2..0. .2..0..0. .2..2..2. .2..1..0. .2..2..1. .2..1..2
%e ..2..0..2. .0..1..1. .2..1..0. .0..1..0. .0..1..2. .2..1..2. .1..0..0
%e ..1..1..0. .2..2..0. .0..0..2. .2..0..2. .0..2..0. .0..0..1. .1..2..1
%Y Cf. A277788.
%K nonn
%O 1,2
%A _R. H. Hardin_, Oct 31 2016
| 