%I #5 Mar 31 2012 12:37:23
%S 122,3456,4155,32813,365195,3673572,36422648,371453021,3793404050,
%T 38533409422,391811506309,3988721278761,40593813655965,
%U 413056518517661,4203452149533013,42777575164793479,435327190739395292
%N Number of nX6 0..2 arrays with new values 0..2 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors)
%C Column 6 of A208434
%H R. H. Hardin, <a href="/A208432/b208432.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=4
%e ..0..1..0..1..1..2....0..1..1..0..1..2....0..0..0..0..0..0....0..1..2..1..1..1
%e ..1..0..2..0..2..0....0..1..2..0..0..2....1..2..1..1..1..2....0..2..2..0..1..2
%e ..0..2..0..2..0..2....0..2..2..0..1..2....2..2..2..1..2..2....0..1..2..0..0..2
%e ..1..0..2..1..2..0....0..1..2..1..1..2....1..2..0..0..0..2....0..1..1..0..1..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 26 2012