|
%I #4 Apr 20 2012 08:22:42
%S 49,343,1953,8903,35361,130515,461513,1597311,5462319,18645525,
%T 63611685,218253317,751458341,2608225775,9093362753,31967242981,
%U 112856339077,401509863725,1433663859719,5154478860067,18587710922523,67433575480987
%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, six or eight distinct values for every i,j,k<=n
%H R. H. Hardin, <a href="/A211756/b211756.txt">Table of n, a(n) for n = 1..27</a>
%e Some solutions for n=5
%e ..3....3....2...-3....0....2....2...-3....0...-1...-3....1...-2....3...-1...-3
%e ..0....2....0...-3...-1....3....2....3...-3....1....1....2...-2....2....2...-3
%e .-3....0...-2...-3....1...-1....2...-1...-2....0...-2....2...-3...-1....2...-1
%e ..0....3....0....1....0....3...-2....1....3....1....1...-1...-1....2....3....1
%e .-2....1...-2....0....0....3....2...-1....2....3...-1....2....0....3....2...-3
%e ..0....2....2...-1....1....0...-3...-3...-1....2....3....0...-1...-1....1...-3
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 20 2012
|
