%I #4 Apr 16 2012 06:54:40
%S 24,116,396,1108,2954,7640,19676,51060,133728,356546,961630,2639484,
%T 7312996,20540736,58061306,165704028,474754182,1368989652,3956576274,
%U 11483585258,33373408392,97258918906,283647632398,828748613072
%N Number of -2..2 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 two, three, four, five or six distinct values for every i,j,k<=n
%H R. H. Hardin, <a href="/A211580/b211580.txt">Table of n, a(n) for n = 1..35</a>
%e Some solutions for n=5
%e .-2...-1...-2...-1....1....1....0....1...-2...-2....2....1....0...-2...-1....1
%e ..0....2...-1....1....2....1....1...-1....2...-1...-2...-1....1...-2....2...-2
%e .-1....1...-2....0....2....1....0....0....1....1....2....0....2...-2...-1...-1
%e ..1...-2...-2...-1....1....0...-1...-2...-1....2...-2....2....1...-2...-1...-2
%e .-1...-1...-1...-2....1...-2....2...-1....1....1....0....1....2...-1....2....1
%e ..0...-2....0....0....0....0....1....0....2....0...-2....0...-2...-1...-1...-2
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 16 2012