A229589 - OEIS

A229589

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

%I #8 Apr 27 2021 21:21:26

%S 0,224,2160,19764,167364,1375152,11035044,87040260,677327004,

%T 5213798784,39777273072,301217858676,2266655495148,16964398022220,

%U 126372108661164,937513290523896,6929886363153768,51058923535878660,375112065125492964

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

%C Row 4 of A229586.

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

%F Empirical: a(n) = 18*a(n-1) - 111*a(n-2) + 282*a(n-3) - 333*a(n-4) + 180*a(n-5) - 36*a(n-6) for n > 12.

%e Some solutions for n=3:

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

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

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

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

%Y Cf. A229586.

%K nonn

%O 1,2

%A _R. H. Hardin_, Sep 26 2013