|
%I #4 Apr 20 2012 08:17:11
%S 48,230,950,3632,13422,48542,173584,620100,2210560,7933738,28500322,
%T 103284630,374776104,1371409876,5022197054,18526229324,68352157746,
%U 253717012028,941511432258,3511229532198,13087482838170,48979882211566
%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 two, four, six or eight distinct values for every i,j,k<=n
%H R. H. Hardin, <a href="/A211749/b211749.txt">Table of n, a(n) for n = 1..52</a>
%e Some solutions for n=5
%e .-1...-1...-1...-3....3....0....3...-3...-3....0....2...-1....1...-1....2....2
%e ..2...-3...-2...-2....3....1....1...-1....0...-3....0....0....2...-1....1....3
%e .-1...-2...-2....3....0...-2...-2....2...-3....0....3...-2....0...-1....3....3
%e ..2....0...-2....2....1...-1....3...-3...-2...-1....2...-3....1...-3....1...-2
%e ..3...-3....0....2....2....2....3...-3...-2....2....1...-3....2...-1....3....3
%e ..2...-2...-2....3....3....3....3...-3...-1...-3....1....0....1....0....0....2
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 20 2012
| 