login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Number of defective 3-colorings of an n X 7 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.
1

%I #8 Apr 27 2021 21:18:00

%S 96,5724,264300,11035044,435326724,16551428868,613195191972,

%T 22285439501940,798023885879412,28242628279003332,990013172442084324,

%U 34429588531063458516,1189375483329032617620,40853134231990887545316

%N Number of defective 3-colorings of an n X 7 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.

%C Column 7 of A229586.

%H R. H. Hardin, <a href="/A229585/b229585.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 84*a(n-1) - 2466*a(n-2) + 31428*a(n-3) - 206469*a(n-4) + 750384*a(n-5) - 1513404*a(n-6) + 1574640*a(n-7) - 656100*a(n-8).

%e Some solutions for n=3:

%e 0 1 2 0 1 0 2 0 1 0 2 1 2 1 0 1 2 0 1 0 1

%e 0 1 2 0 2 1 0 0 1 0 2 1 2 1 0 1 2 0 1 0 1

%e 2 1 2 1 2 1 1 0 2 0 2 1 2 2 0 2 1 0 2 0 2

%Y Cf. A229586.

%K nonn

%O 1,1

%A _R. H. Hardin_, Sep 26 2013