The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #3 Apr 20 2012 08:25:52
%S 49,239,1091,4701,19429,77363,299181,1131389,4199109,15400453,
%T 55862597,201630759,723544713,2595026445,9284175047,33286441441,
%U 119287476753,429013756705,1543962886085,5579862221185,20189693737355,73367588542073
%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, seven or eight distinct values for every i,j,k<=n
%e Some solutions for n=5
%e ..1....3...-3....3....3....1....3....0....3...-1...-3....2...-2....0...-3...-1
%e ..1....2...-1....2....2....2....0....1...-1...-1...-2....2....3...-3....2...-2
%e ..3...-3....2...-3...-1....3....2....1...-1....2...-3....2...-1....0...-1....3
%e .-2....2...-3....2....3....2....2...-2...-2...-1....0...-3....3....1....2....0
%e ..3....2...-2...-1...-1....0....1....3....1...-2...-2....1....3....1...-1...-1
%e ..0....2...-3...-1...-1....2....1...-2...-2...-3...-2....2....3....0...-1...-1
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 20 2012