|
%I #9 Apr 28 2021 01:22:28
%S 0,101376,7952256,437924880,21063718224,937213830720,39647663129952,
%T 1617006498774912,64143524707305984,2489243835565159488,
%U 94897266574306915296,3564781098414437505600,132254323024723203273120
%N Number of defective 3-colorings of an n X 7 0..2 array connected diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order.
%C Column 7 of A229685.
%H R. H. Hardin, <a href="/A229684/b229684.txt">Table of n, a(n) for n = 1..172</a>
%H R. H. Hardin, <a href="/A229684/a229684.txt">Empirical recurrence of order 46</a>
%F Empirical recurrence of order 46 (see link above).
%e Some solutions for n=3:
%e 0 0 1 1 1 0 1 0 0 1 0 1 0 1 0 1 1 2 1 2 1
%e 1 0 2 0 2 0 1 2 0 1 0 1 0 1 2 0 0 0 0 0 0
%e 0 0 1 0 2 0 1 2 2 2 0 1 2 2 2 1 1 1 2 1 0
%K nonn
%O 1,2
%A _R. H. Hardin_, Sep 27 2013
| 