|
%I #4 Apr 20 2012 08:25:07
%S 36,154,600,2160,7520,25300,83944,275424,896780,2930032,9514764,
%T 31283068,102154068,339451248,1118239532,3758067700,12492423608,
%U 42409118936,142090246012,486328578676,1639690884804,5647319658404,19130793115084
%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, six, seven or eight distinct values for every i,j,k<=n
%H R. H. Hardin, <a href="/A211759/b211759.txt">Table of n, a(n) for n = 1..28</a>
%e Some solutions for n=5
%e ..0....2....3....2...-1....3...-2....0....2...-3...-2...-3...-1....0....2...-2
%e ..1...-3....2...-3....2....2...-3...-2...-1....0...-3....0....2....1...-3....1
%e ..2...-2...-3...-2....3....3...-2....0....0...-1....0...-1...-1....0....0....2
%e ..3....3...-2...-1....0....2....0...-2...-3...-2...-3....0....2....2....1...-1
%e .-2...-2...-3....0....3...-1...-1....0....2....1....2...-1...-3....0....2....2
%e .-3....3....2...-2....0....3...-2...-1...-3....2...-3....2....2....2...-1....3
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 20 2012
| 