The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #5 Mar 31 2012 12:37:32
%S 29,1039,25901,592969,13233079,292930403,6467110597,142651105201,
%T 3145676312903,69360351853819,1529307333302941,33718923388205609,
%U 743448896978561935,16391852782863165859,361413860134081682837
%N Number of (n+1)X3 0..3 arrays containing all values 0..3 with every 2X2 subblock having three distinct values, and new values 0..3 introduced in row major order
%C Column 2 of A210267
%H R. H. Hardin, <a href="/A210261/b210261.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 32*a(n-1) -225*a(n-2) +2856*a(n-4) -2952*a(n-5) -4100*a(n-6) +3664*a(n-7) -384*a(n-8)
%e Some solutions for n=4
%e ..0..1..1....0..0..0....0..0..0....0..0..1....0..0..1....0..0..0....0..0..0
%e ..2..0..2....1..2..3....1..2..1....2..1..2....1..2..0....1..2..1....1..2..3
%e ..0..1..0....3..2..1....0..0..0....0..0..1....3..3..2....2..3..1....0..1..2
%e ..3..3..3....1..1..3....1..2..1....1..2..1....0..1..2....1..3..2....1..3..1
%e ..1..2..1....3..0..1....3..3..1....1..3..3....1..2..3....3..0..2....0..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 19 2012