A211758 - OEIS

A211758

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, seven or eight distinct values for every i,j,k<=n

%I #4 Apr 20 2012 08:24:20

%S 48,230,966,3828,14558,54150,197696,716828,2577250,9274498,33265006,

%T 119874762,431653980,1564101296,5669405566,20684964244,75518514030,

%U 277412188326,1019662031306,3768412193514,13932784344886,51754946786278

%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, seven or eight distinct values for every i,j,k<=n

%H R. H. Hardin, <a href="/A211758/b211758.txt">Table of n, a(n) for n = 1..36</a>

%e Some solutions for n=5

%e ..2....1...-3....0...-2....1....2....2....3....1...-2...-2....2....1....1....3

%e .-1....3...-3....1...-1....3....1....2...-1....3...-3....0....0....2....3....0

%e .-2....3...-1....2...-2....1....3....2....3....2...-3...-1....3....1....3...-1

%e .-3....2...-1...-1...-1....2....2....0...-1....2...-2...-2....3...-2....3....0

%e ..2....3...-2....0...-3....1....0....2....2....2...-1...-2....3....1....3...-3

%e ..3....3...-1...-3....2....1....3....1....3....1....0...-1...-2....2....0....2

%K nonn

%O 1,1

%A _R. H. Hardin_ Apr 20 2012