%I #4 Apr 20 2012 08:12:06
%S 49,239,815,2425,6901,19179,52773,145469,400713,1115601,3110323,
%T 8788819,24852989,71239929,204020245,591763945,1711883257,5010260001,
%U 14603694017,43023663753,126092893931,373234182183,1098179433481,3261494794727
%N Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having one, two, three, four, six or seven distinct values for every i,j,k<=n
%H R. H. Hardin, <a href="/A211741/b211741.txt">Table of n, a(n) for n = 1..46</a>
%e Some solutions for n=5
%e .-3...-3....3...-1...-1....3...-3....3....0...-1....0...-1...-1...-1....2...-2
%e .-3....2....1...-2...-2....0....0...-2....1...-3...-1...-2....3...-1...-3...-1
%e .-3...-3...-2....1....3...-1....3....3....2...-2....0...-3...-1...-1....1...-2
%e .-1...-1....1....2....3....0....0....3....1....0...-2...-1...-1...-1...-3....0
%e .-3....1...-2...-1....3....3...-3...-2....2...-1...-1...-2....3....0....2...-1
%e .-3...-1....1...-2....3....0....2...-2....2...-3....0...-3....3...-1...-1...-3
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 20 2012