|
%I #8 Apr 28 2021 01:24:14
%S 3,652,19805,328160,4331928,50919512,557478448,5814322288,58526242224,
%T 573293485312,5495680088320,51763989177088,480493519118080,
%U 4405407183929600,39966207303657728,359270403366182912
%N Number of defective 4-colorings of an n X 4 0..3 array connected horizontally, antidiagonally and vertically with exactly two mistakes, and colors introduced in row-major 0..3 order.
%C Column 4 of A229672.
%H R. H. Hardin, <a href="/A229668/b229668.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 36*a(n-1) - 552*a(n-2) + 4812*a(n-3) - 27168*a(n-4) + 107904*a(n-5) - 316720*a(n-6) + 703296*a(n-7) - 1187712*a(n-8) + 1506368*a(n-9) - 1379328*a(n-10) + 835584*a(n-11) - 262144*a(n-12) for n > 14.
%e Some solutions for n=3:
%e 0 1 0 0 0 1 2 1 0 1 2 3 0 1 2 3 0 1 2 3
%e 2 3 2 1 2 2 0 2 0 3 1 0 3 0 0 2 2 3 0 2
%e 0 0 3 2 0 1 3 0 2 0 3 3 2 1 2 0 1 0 1 1
%K nonn
%O 1,1
%A _R. H. Hardin_, Sep 27 2013
| 