|
%I #4 Apr 20 2012 08:21:57
%S 48,330,1836,8280,32740,120728,427390,1483442,5092432,17465996,
%T 59892736,206614336,715176178,2495327868,8742073364,30872946806,
%U 109440726728,390821924176,1400125471630,5048928185428,18254562891404,66379155129368
%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, three, four, five, six or eight distinct values for every i,j,k<=n
%H R. H. Hardin, <a href="/A211755/b211755.txt">Table of n, a(n) for n = 1..25</a>
%e Some solutions for n=5
%e .-3....0....2...-2....0....2...-2....1...-1...-2....2....0...-2....1....1....1
%e ..0...-3...-1...-3....3...-2....1...-3...-1...-2....3...-1....0....3...-3...-3
%e ..3...-3....3...-3....2...-2...-1...-3....1...-3....3...-3...-2....2...-1...-1
%e ..0...-2....3...-3....2...-3...-1...-3...-3....2....0...-1....0...-3...-3...-1
%e .-1...-3....3...-1....2....1...-3...-3...-3...-1...-1....3....2...-2....1...-3
%e ..2....1...-1...-1....2...-3...-3....3...-3...-3....2....3...-1...-3...-3....1
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 20 2012
| 