%I #8 Apr 27 2021 21:30:54
%S 40,368,7460,130854,2171944,34811238,544403948,8359264560,
%T 126546766896,1894158617022,28090954101848,413405522888606,
%U 6044542909770790,87888904584082718,1271780829814090170,18325726435067557004
%N Number of defective 3-colorings of an n X 6 0..2 array connected horizontally, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.
%C Column 6 of A229534.
%H R. H. Hardin, <a href="/A229532/b229532.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 36*a(n-1) - 436*a(n-2) + 1854*a(n-3) + 340*a(n-4) - 19128*a(n-5) + 23849*a(n-6) + 56184*a(n-7) - 108224*a(n-8) - 40816*a(n-9) + 160400*a(n-10) - 34136*a(n-11) - 83203*a(n-12) + 42628*a(n-13) + 6468*a(n-14) - 6334*a(n-15) + 204*a(n-16) + 240*a(n-17) - 25*a(n-18) for n > 19.
%e Some solutions for n=4:
%e 0 1 0 1 0 1 0 1 0 2 1 2 0 1 2 0 1 0 0 0 1 2 1 2
%e 2 1 2 1 2 1 0 1 0 2 0 2 0 1 2 0 2 0 1 2 1 2 1 2
%e 2 0 2 0 2 1 0 1 0 1 0 1 2 1 2 1 2 1 1 2 0 2 1 2
%e 0 1 2 1 2 1 1 2 0 2 0 1 2 0 2 1 0 0 0 2 0 2 1 0
%Y Cf. A229534.
%K nonn
%O 1,1
%A _R. H. Hardin_, Sep 25 2013