|
%I #4 Apr 20 2012 08:05:51
%S 49,343,1421,4551,13555,39169,111793,322077,933135,2752147,8199745,
%T 24862257,76130649,236603551,741329977,2350346441,7498037945,
%U 24138736345,78063226797,254189827701,830340918003,2726288861857,8971039826201
%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 one, two, three, four, five or six distinct values for every i,j,k<=n
%H R. H. Hardin, <a href="/A211736/b211736.txt">Table of n, a(n) for n = 1..46</a>
%e Some solutions for n=5
%e .-3...-3....2....2....0....0....2....1...-3....0....3....3....2....1...-3....1
%e ..1....3...-3...-1...-1....3....1...-3....1...-3....3....2....0...-3...-2...-1
%e .-3...-1....2...-2....1....0....2...-3....0....0....1....0....1...-2...-3....1
%e ..2....1...-3...-3....3....1....3...-3....0...-3....3...-1....0...-1...-2...-1
%e .-3....1....1...-2....1....0....0....1...-2...-2....1...-2...-1...-2....3...-1
%e ..2....1...-3...-1....2....1....1...-3....0...-3....1...-3...-2....2...-2...-1
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 20 2012
|
