The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #4 Apr 20 2012 08:03:34
%S 36,186,620,1780,4840,13108,34968,95300,258084,715112,1970400,5539668,
%T 15468616,43974160,123983696,355470488,1009507724,2914043384,
%U 8322676556,24159321760,69319250572,202175077828,582318461756,1705203219856
%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 three, four, five or six distinct values for every i,j,k<=n
%H R. H. Hardin, <a href="/A211733/b211733.txt">Table of n, a(n) for n = 1..51</a>
%e Some solutions for n=5
%e ..2...-3...-2...-1...-1....0...-2....0...-1...-1....1....3....2....3....1....1
%e ..3....0...-1....0....3...-3...-1....1....0....2....3....0....0....0...-3....0
%e ..0....3....0....3....2...-2....0...-2....2....1....0...-1....3...-2....1....1
%e .-1....0....1....2....1....1...-1....1....3...-2....3...-2....0....0....3....2
%e ..0...-3....2....1....2....0...-2...-2....1...-1....1....1...-3...-3....1....1
%e ..1....1....1...-2....1...-3...-1....1....2....0....3....0....0....0...-2....0
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 20 2012