|
%I #10 Apr 27 2021 21:19:10
%S 224,14580,763031,36985536,1718447506,77626332302,3435347473308,
%T 149656305350148,6438654748003193,274212704255144208,
%U 11580589287566252205,485629666389979680308,20242557309273462409473
%N Number of defective 3-colorings of an n X 8 0..2 array connected horizontally and vertically with exactly one mistake and colors introduced in row-major 0..2 order.
%C Column 8 of A229460.
%H R. H. Hardin, <a href="/A229459/b229459.txt">Table of n, a(n) for n = 1..210</a>
%H R. H. Hardin, <a href="/A229459/a229459.txt">Empirical recurrence of order 38</a>
%F Empirical recurrence of order 38 (see link above).
%e Some solutions for n=3:
%e 0 0 1 0 2 1 0 2 0 1 0 2 0 2 0 2 0 1 0 1 2 0 1 0
%e 2 1 0 2 1 0 2 0 0 2 1 0 2 0 2 1 1 0 1 0 1 2 0 1
%e 1 0 2 1 0 2 0 2 2 1 2 1 0 2 1 0 0 1 0 2 2 1 2 0
%Y Cf. A229460.
%K nonn
%O 1,1
%A _R. H. Hardin_, Sep 24 2013
| 