|
%I #8 Apr 28 2021 01:22:31
%S 0,17280,959040,35485776,1138164048,33555543408,937213830720,
%T 25175909234736,656711865897408,16739441074986336,418806827449472592,
%U 10318185686783039760,250943458030201728144,6036117745064710768416
%N Number of defective 3-colorings of an n X 6 0..2 array connected diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order.
%C Column 6 of A229685.
%H R. H. Hardin, <a href="/A229683/b229683.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 75*a(n-1) - 2010*a(n-2) + 19486*a(n-3) + 60075*a(n-4) - 2206575*a(n-5) + 7404210*a(n-6) + 70536825*a(n-7) - 435322350*a(n-8) - 601275555*a(n-9) + 8082823950*a(n-10) - 6257717775*a(n-11) - 54520532190*a(n-12) + 92909172825*a(n-13) + 132368667075*a(n-14) - 366499782594*a(n-15) + 470715894135*a(n-17) - 282429536481*a(n-18) for n > 20.
%e Some solutions for n=3:
%e 0 1 1 0 1 2 0 1 1 0 1 0 0 1 1 0 1 0 0 0 1 0 2 0
%e 2 0 2 2 1 0 2 0 0 0 1 0 2 0 0 0 2 0 0 0 2 0 2 0
%e 1 1 1 0 2 2 1 1 2 2 2 0 2 1 2 1 2 0 1 1 2 0 2 0
%K nonn
%O 1,2
%A _R. H. Hardin_, Sep 27 2013
| 