%I #10 Apr 28 2021 01:22:53
%S 0,3924,50084,747299,11485716,170405645,2495874984,35693194243,
%T 503332240292,6990933433009,96001895136772,1304362116389856,
%U 17565879194817688,234673938451844201,3113368949256998744
%N Number of defective 3-colorings of a 6 X n 0..2 array connected horizontally, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order.
%C Row 6 of A229637.
%H R. H. Hardin, <a href="/A229642/b229642.txt">Table of n, a(n) for n = 1..210</a>
%H R. H. Hardin, <a href="/A229642/a229642.txt">Empirical recurrence of order 69</a>
%F Empirical recurrence of order 69 (see link above).
%e Some solutions for n=3:
%e 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0
%e 2 1 2 2 1 2 2 1 0 2 1 2 0 1 0 0 2 1 1 2 1
%e 2 1 0 1 1 0 2 0 1 1 0 1 2 0 2 0 1 0 1 0 1
%e 2 1 0 0 2 0 2 0 1 1 0 1 1 0 2 2 1 0 2 0 2
%e 1 2 0 1 2 0 1 0 1 1 0 2 1 0 1 2 1 0 2 1 2
%e 0 2 1 0 2 1 2 0 1 1 0 2 2 0 1 0 1 0 2 0 2
%K nonn
%O 1,2
%A _R. H. Hardin_, Sep 27 2013