|
%I #8 Apr 28 2021 01:22:57
%S 0,925,8800,89331,960325,9722206,98015235,960209886,9295982009,
%T 88583128280,835152387679,7790969750780,72061578435025,
%U 661325695334298,6028108188010041,54611818274641520,492062341420006203
%N Number of defective 3-colorings of a 5 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 5 of A229637.
%H R. H. Hardin, <a href="/A229641/b229641.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 18*a(n-1) - 15*a(n-2) - 1191*a(n-3) + 3468*a(n-4) + 31983*a(n-5) - 108707*a(n-6) - 424479*a(n-7) + 1614489*a(n-8) + 2851598*a(n-9) - 13478352*a(n-10) - 7797810*a(n-11) + 66347438*a(n-12) - 12632640*a(n-13) - 190067859*a(n-14) + 147888798*a(n-15) + 287096430*a(n-16) - 412178619*a(n-17) - 138135927*a(n-18) + 522690894*a(n-19) - 168525432*a(n-20) - 273411640*a(n-21) + 227616084*a(n-22) + 9610272*a(n-23) - 73617984*a(n-24) + 21460464*a(n-25) + 7359984*a(n-26) - 4611168*a(n-27) + 186624*a(n-28) + 279936*a(n-29) - 46656*a(n-30) for n > 33.
%e Some solutions for n=3:
%e 0 1 2 0 1 0 0 1 2 0 1 1 0 1 0 0 1 2 0 1 2
%e 2 1 2 2 1 2 0 1 2 0 1 0 0 2 0 0 1 0 2 1 0
%e 1 0 2 2 0 2 0 2 0 2 1 2 0 2 0 2 2 0 2 1 2
%e 2 1 2 2 0 1 0 2 1 2 0 2 0 2 1 0 2 0 0 1 0
%e 2 1 0 0 2 1 1 0 1 1 0 2 2 0 1 1 2 0 1 1 2
%K nonn
%O 1,2
%A _R. H. Hardin_, Sep 27 2013
| 