%I #6 Mar 02 2023 12:38:04
%S 48,230,690,1896,4914,12834,33110,87532,231044,626294,1696208,4710442,
%T 13035934,36914622,103843336,298400536,849446000,2467182708,
%U 7083241528,20732756786,59887058198,176273740060,511404834472,1511408416446
%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 seven distinct values for every i,j,k<=n.
%H R. H. Hardin, <a href="/A211738/b211738.txt">Table of n, a(n) for n = 1..37</a>
%e Some solutions for n=5
%e .-2....1....0....0....2....0....2...-2...-2....3...-2....1....3....2....3...-2
%e .-3...-3...-1...-2....1...-3....3...-1...-3....2...-1....0....0...-3...-2...-1
%e .-2....1...-2...-1....2....2....2....0....1....2...-3....1....3....2....3...-1
%e .-1....1....1...-2...-1....2...-1...-1...-3....1...-1....2....0...-3...-2....0
%e ..0...-3...-2....0....2....2....2...-1....1....2...-2....3....1....2...-2...-1
%e .-2....1...-1...-1....3....2....3....0....2....3...-3....3...-2...-3....3...-2
%K nonn
%O 1,1
%A _R. H. Hardin_, Apr 20 2012