%I #8 Apr 28 2021 01:23:49
%S 40,5077,230383,8186713,258006388,7551515197,210095323918,
%T 5632122625852,146747625919741,3738362679893995,93505337317628617,
%U 2303524911169269100,56025377123719298929,1347778566401139093298,32117071054579505478784
%N Number of defective 3-colorings of an n X 6 0..2 array connected horizontally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order.
%C Column 6 of A229694.
%H R. H. Hardin, <a href="/A229692/b229692.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 75*a(n-1) - 2145*a(n-2) + 29368*a(n-3) - 205200*a(n-4) + 803115*a(n-5) - 1842183*a(n-6) + 2460375*a(n-7) - 1771470*a(n-8) + 531441*a(n-9) for n > 11.
%e Some solutions for n=3:
%e 0 1 2 1 0 0 0 1 0 1 2 2 0 1 0 2 0 2 0 1 2 1 2 0
%e 0 1 0 2 2 1 0 2 0 1 0 1 0 2 0 2 2 0 0 0 2 0 1 0
%e 2 1 0 1 2 0 2 1 2 1 2 0 0 2 0 1 2 1 1 0 1 2 0 1
%K nonn
%O 1,1
%A _R. H. Hardin_, Sep 27 2013