|
%I #7 Sep 19 2018 15:15:15
%S 40,1620,49848,1375152,35690460,890824020,21639043284,515235810840,
%T 12081465854052,279877517457936,6420164883723960,146080173897129444,
%U 3301145304079911108,74165789377610689020,1657889614174445634696
%N Number of defective 3-colorings of an n X 6 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.
%H R. H. Hardin, <a href="/A229584/b229584.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 50*a(n-1) - 805*a(n-2) + 4662*a(n-3) - 12150*a(n-4) + 14580*a(n-5) - 6561*a(n-6).
%F Empirical g.f.: 4*x*(10 - 95*x + 262*x^2 + 93*x^3 - 1485*x^4 + 1701*x^5) / (1 - 25*x + 90*x^2 - 81*x^3)^2. - _Colin Barker_, Sep 19 2018
%e Some solutions for n=3:
%e ..0..1..2..1..0..1....0..1..0..1..0..1....0..1..2..0..1..2....0..1..2..1..0..1
%e ..0..1..2..0..2..1....2..1..2..1..2..0....2..0..2..0..0..2....2..0..2..1..0..1
%e ..0..1..2..1..0..2....2..1..0..2..1..2....2..0..1..2..1..0....2..0..2..2..0..2
%Y Column 6 of A229586.
%K nonn
%O 1,1
%A _R. H. Hardin_, Sep 26 2013
| 