|
%I #8 Apr 28 2021 01:22:49
%S 0,15795,277996,6049298,133784624,2902520386,61836040854,
%T 1290897457785,26533491049453,537479161392127,10758714918897447,
%U 213067493458619915,4181337838281995586,81391742898664549466,1573067212373296604298
%N Number of defective 3-colorings of a 7 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 7 of A229637.
%H R. H. Hardin, <a href="/A229643/b229643.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3:
%e 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0
%e 2 1 0 0 1 2 0 1 2 0 1 2 2 1 0 0 1 0 0 1 2
%e 2 2 0 0 2 1 0 0 2 2 1 0 0 2 2 0 1 0 0 1 0
%e 0 1 0 1 2 0 2 1 2 1 2 0 0 1 0 2 1 2 0 2 0
%e 0 2 0 1 2 0 2 1 0 1 2 0 0 2 0 0 2 0 0 1 1
%e 0 1 0 0 2 0 0 1 0 1 2 1 0 2 1 1 2 1 0 1 2
%e 0 1 2 0 2 0 2 1 0 1 2 0 1 2 1 0 2 0 2 1 0
%K nonn
%O 1,2
%A _R. H. Hardin_, Sep 27 2013
| 