login

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

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

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

%S 0,84,356,3064,19276,130854,833108,5305746,33122792,205196216,

%T 1258781344,7670081250,46440194380,279724889174,1677103031212,

%U 10014905982560,59591710277588,353467715910526,2090642805771012,12333845570879546

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

%C Row 4 of A229534.

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

%F Empirical: a(n) = 6*a(n-1) + 23*a(n-2) - 102*a(n-3) - 288*a(n-4) + 250*a(n-5) + 787*a(n-6) - 238*a(n-7) - 741*a(n-8) + 124*a(n-9) + 196*a(n-10) - 16*a(n-11) - 16*a(n-12) for n > 14.

%e Some solutions for n=4:

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

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

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

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

%Y Cf. A229534.

%K nonn

%O 1,2

%A _R. H. Hardin_, Sep 25 2013