|
%I #9 Apr 27 2021 21:33:00
%S 12,488,6031,77620,960325,11485716,133784624,1525870912,17108056051,
%T 189113977298,2065634425127,22332806237194,239326746885334,
%U 2544956244990312,26878587507519977,282161860575964390
%N Number of defective 3-colorings of an n X 5 0..2 array connected horizontally, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order.
%C Column 5 of A229637.
%H R. H. Hardin, <a href="/A229634/b229634.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 42*a(n-1) - 723*a(n-2) + 6569*a(n-3) - 33687*a(n-4) + 94839*a(n-5) - 116010*a(n-6) - 55215*a(n-7) + 305043*a(n-8) - 230994*a(n-9) - 118011*a(n-10) + 243513*a(n-11) - 84933*a(n-12) - 40719*a(n-13) + 42804*a(n-14) - 14887*a(n-15) + 2598*a(n-16) - 228*a(n-17) + 8*a(n-18) for n > 20.
%e Some solutions for n=3:
%e 0 1 2 2 0 0 1 0 1 0 0 1 2 1 0 0 1 2 0 2
%e 0 1 2 1 0 2 1 2 1 0 0 1 2 0 2 0 1 0 1 0
%e 0 1 2 1 2 2 0 2 0 0 2 0 2 0 2 0 2 0 1 0
%Y Cf. A229637.
%K nonn
%O 1,1
%A _R. H. Hardin_, Sep 27 2013
| 