cp's OEIS Frontend

A229696 Number of defective 3-colorings of a 3 X n 0..2 array connected horizontally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order.

%I A229696 #8 Apr 28 2021 01:23:45
%S A229696 0,40,626,5077,35825,230383,1400413,8184819,46455457,257724695,
%T A229696 1403839397,7532391243,39908047865,209177764015,1086276818845,
%U A229696 5595663437379,28620024582289,145460267764487,735134318022101
%N A229696 Number of defective 3-colorings of a 3 X n 0..2 array connected horizontally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order.
%C A229696 Row 3 of A229694.
%H A229696 R. H. Hardin, <a href="/A229696/b229696.txt">Table of n, a(n) for n = 1..210</a>
%F A229696 Empirical: a(n) = 15*a(n-1) - 81*a(n-2) + 185*a(n-3) - 162*a(n-4) + 60*a(n-5) - 8*a(n-6) for n > 10.
%e A229696 Some solutions for n=3:
%e A229696   0 1 0   0 1 0   0 1 1   0 0 1   0 1 0   0 1 0   0 1 0
%e A229696   0 1 1   2 0 0   1 2 0   0 2 0   1 2 0   0 1 2   2 0 2
%e A229696   2 1 0   2 1 2   0 2 1   0 1 2   1 1 2   1 2 1   1 1 0
%K A229696 nonn
%O A229696 1,2
%A A229696 _R. H. Hardin_, Sep 27 2013