%I #8 Apr 27 2021 21:22:09
%S 0,1152,16416,224532,2865780,35690460,435326724,5230362804,
%T 62078234652,729497509476,8501915068020,98397780931572,
%U 1132075322344044,12958123181386308,147663327988334916,1676107610928542292
%N Number of defective 3-colorings of a 5 X n 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.
%C Row 5 of A229586.
%H R. H. Hardin, <a href="/A229590/b229590.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 32*a(n-1) - 384*a(n-2) + 2200*a(n-3) - 6494*a(n-4) + 9016*a(n-5) - 816*a(n-6) - 14888*a(n-7) + 18879*a(n-8) - 5464*a(n-9) - 7472*a(n-10) + 8336*a(n-11) - 3648*a(n-12) + 768*a(n-13) - 64*a(n-14) for n > 18.
%e Some solutions for n=3:
%e 0 1 0 0 1 0 0 1 0 0 1 2 0 1 2 0 1 0 0 1 2
%e 0 2 0 2 1 1 1 2 0 0 1 0 0 1 0 0 1 2 2 0 1
%e 0 2 0 2 0 2 0 2 0 1 2 1 0 1 0 2 1 1 1 2 0
%e 0 2 1 2 0 1 1 2 0 1 0 2 0 2 0 2 0 1 1 2 0
%e 2 0 2 1 2 1 1 2 1 2 0 2 1 0 2 1 0 1 2 1 2
%Y Cf. A229586.
%K nonn
%O 1,2
%A _R. H. Hardin_, Sep 26 2013