# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a229505
Showing 1-1 of 1

%I A229505 #9 Jun 16 2017 05:26:18
%S A229505 0,48,480,4032,31104,228096,1617408,11197440,76142592,510603264,
%T A229505 3386105856,22251552768,145118822400,940369969152,6060162023424,
%U A229505 38868625391616,248257671856128,1579821548175360,10020582391283712
%N A229505 Number of defective 3-colorings of an n X 3 0..2 array connected diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.
%C A229505 Column 3 of A229510
%H A229505 R. H. Hardin, <a href="/A229505/b229505.txt">Table of n, a(n) for n = 1..210</a>
%F A229505 Empirical: a(n) = 12*a(n-1) - 36*a(n-2) for n>3.
%F A229505 Conjectures from _Colin Barker_, Jun 16 2017: (Start)
%F A229505 G.f.: 48*x^2*(1 - 2*x) / (1 - 6*x)^2.
%F A229505 a(n) = 2^(2+n)*3^(n-2)*(2*n - 1) for n>1.
%F A229505 (End)
%e A229505 Some solutions for n=4
%e A229505 ..0..0..1....0..1..2....0..1..1....0..1..0....0..1..2....0..1..0....0..1..0
%e A229505 ..2..2..2....2..1..2....2..2..0....0..2..0....0..1..0....2..2..2....2..1..2
%e A229505 ..0..1..1....0..1..0....0..1..1....1..1..0....1..1..2....1..0..0....1..0..2
%e A229505 ..1..2..0....1..2..2....2..2..1....0..2..1....0..0..2....1..2..0....2..0..1
%K A229505 nonn
%O A229505 1,2
%A A229505 _R. H. Hardin_, Sep 25 2013

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE