|
%I #6 Sep 10 2023 20:52:54
%S 36,186,804,2968,10092,32712,103184,323816,1008108,3181896,10019520,
%T 32241100,103445952,339993680,1110750880,3717193820,12320871456,
%U 41800702528,140023160932,479705387124,1618787129800,5583205551016
%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, six or eight distinct values for every i,j,k<=n.
%H R. H. Hardin, <a href="/A211753/b211753.txt">Table of n, a(n) for n = 1..34</a>
%e Some solutions for n=5
%e .-2....1....2...-3...-1....0...-2....2....1...-2....2....0...-2....2....1....1
%e .-1...-2....1....0...-2....1....1....3...-3....1....0...-1...-1....3....2...-2
%e .-3....1....3...-2...-1....3...-3....2....1....3....1....0....0....0....1....1
%e ..0....3....1....0...-2....2....2....0....2....1....0....3....2...-2...-2...-2
%e .-3....1....3...-1....0....3....1....1....3....3....1....0....3....0...-1...-3
%e .-1...-3....0...-2....2....0....2....2...-1....2....3...-3....2...-2....2....2
%K nonn
%O 1,1
%A _R. H. Hardin_, Apr 20 2012
| 