|
%I #8 Apr 28 2021 01:22:45
%S 12,5048,194575,4331928,78681904,1289285440,19833096240,292113020848,
%T 4166458573712,57969095029904,790685144800368,10610748626178800,
%U 140470975441761744,1838307497254313168,23820028631434272176
%N Number of defective 4-colorings of an n X 5 0..3 array connected horizontally, antidiagonally and vertically with exactly two mistakes, and colors introduced in row-major 0..3 order.
%C Column 5 of A229672.
%H R. H. Hardin, <a href="/A229669/b229669.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 66*a(n-1) - 1983*a(n-2) + 36508*a(n-3) - 468807*a(n-4) + 4527234*a(n-5) - 34485537*a(n-6) + 213596064*a(n-7) - 1095467256*a(n-8) + 4692517600*a(n-9) - 16779635712*a(n-10) + 49467398400*a(n-11) - 116139110400*a(n-12) + 197107906560*a(n-13) - 151773413376*a(n-14) - 378891157504*a(n-15) + 1841068769280*a(n-16) - 4016144252928*a(n-17) + 4768264093696*a(n-18) - 62024318976*a(n-19) - 11965845995520*a(n-20) + 24277831122944*a(n-21) - 21830698008576*a(n-22) - 1777915133952*a(n-23) + 29048877088768*a(n-24) - 34853659607040*a(n-25) + 19378892439552*a(n-26) - 4398046511104*a(n-27) for n > 29.
%e Some solutions for n=3:
%e 0 1 2 0 1 0 1 2 1 2 0 1 2 1 0 0 1 2 0 3
%e 2 0 1 1 3 2 3 0 1 1 0 3 0 3 2 0 3 1 2 1
%e 1 2 3 2 0 0 1 2 0 2 1 2 1 1 3 1 0 0 3 0
%K nonn
%O 1,1
%A _R. H. Hardin_, Sep 27 2013
| 