cp's OEIS Frontend

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 A229589 #8 Apr 27 2021 21:21:26
%S A229589 0,224,2160,19764,167364,1375152,11035044,87040260,677327004,
%T A229589 5213798784,39777273072,301217858676,2266655495148,16964398022220,
%U A229589 126372108661164,937513290523896,6929886363153768,51058923535878660,375112065125492964
%N 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.
%C A229589 Row 4 of A229586.
%H A229589 R. H. Hardin, <a href="/A229589/b229589.txt">Table of n, a(n) for n = 1..210</a>
%F A229589 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 A229589 Some solutions for n=3:
%e A229589   0 1 0   0 0 1   0 1 0   0 1 0   0 1 0   0 1 2   0 0 1
%e A229589   2 2 1   2 0 1   2 2 0   2 2 1   0 2 2   2 0 2   1 0 2
%e A229589   1 0 1   1 2 1   0 2 1   0 2 0   0 1 2   1 0 1   2 1 2
%e A229589   2 0 2   0 2 0   0 2 1   0 2 0   2 0 2   2 2 0   0 1 0
%Y A229589 Cf. A229586.
%K A229589 nonn
%O A229589 1,2
%A A229589 _R. H. Hardin_, Sep 26 2013