|
%I #6 Jun 18 2022 18:35:32
%S 16,324,4962,68790,903332,11451686,141595454,1718447506,20556781248,
%T 243096369158,2847922372290,33104931317106,382296017735388,
%U 4389980739706374,50166156571004678,570836263990509842
%N Number of defective 3-colorings of an n X 5 0..2 array connected horizontally and vertically with exactly one mistake and colors introduced in row-major 0..2 order.
%C Column 5 of A229460.
%H R. H. Hardin, <a href="/A229456/b229456.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 32*a(n-1) -386*a(n-2) +2264*a(n-3) -7265*a(n-4) +13512*a(n-5) -14960*a(n-6) +9872*a(n-7) -3776*a(n-8) +768*a(n-9) -64*a(n-10).
%e Some solutions for n=3
%e ..0..1..2..1..2....0..1..2..0..2....0..1..0..1..0....0..1..0..1..2
%e ..2..2..1..2..1....2..1..0..1..0....1..2..1..2..1....2..2..1..2..0
%e ..0..1..0..1..2....1..2..1..2..1....2..1..0..2..0....1..0..2..1..2
%Y Cf. A229460.
%K nonn
%O 1,1
%A _R. H. Hardin_, Sep 24 2013
| 