%I #4 Apr 20 2012 08:21:12
%S 37,199,893,3323,11273,36159,112703,348665,1071523,3339079,10404975,
%T 33170833,105676217,345291137,1123296141,3746722541,12390256743,
%U 41963112457,140402923347,480591164385,1620851816467,5588010236041
%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, three, four, five, six or eight distinct values for every i,j,k<=n
%H R. H. Hardin, <a href="/A211754/b211754.txt">Table of n, a(n) for n = 1..35</a>
%e Some solutions for n=5
%e ..2...-1....0....0....3...-1....1...-2...-3....2....2....0....0....2...-1....0
%e .-3...-2...-3...-3....2....3...-2....3...-1....0...-3...-2....0....3....0...-2
%e .-2....1....0...-1....0....1...-1...-2....3....0...-2...-3...-1...-1...-3....1
%e .-1....2...-1...-2....3....3...-2....0...-1...-2...-3...-1....0....3...-2...-2
%e ..2....1....2....0....2....0...-1....1....3....0...-2....0....2....2...-3...-3
%e ..1....3...-3...-2....0....1....2....0....1...-2...-3...-3....3...-1....2...-1
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 20 2012