|
%I #4 Apr 20 2012 08:27:44
%S 36,186,944,4764,23824,118360,584192,2867280,14000960,68054336,
%T 329428048,1588714080,7636061184,36590420768,174849450144,
%U 833428507648,3963494947280,18809675141312,89095618484832,421283134048224
%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 three, four, five, six, seven or eight distinct values for every i,j,k<=n
%H R. H. Hardin, <a href="/A211764/b211764.txt">Table of n, a(n) for n = 1..32</a>
%e Some solutions for n=5
%e ..1....1....3....2....3....0...-1....0...-3....3...-3....2...-3....3....0....1
%e .-3...-3...-1....1....0...-1....0...-1...-2....0....0...-1....2....1....3....0
%e ..1...-2....2...-3...-3....3...-2....2...-3...-3....1....2...-1...-2...-1....2
%e .-3....1...-3....2....2...-1...-1....1...-2....1...-2...-1....0...-1....3....0
%e ..1....0...-2....0....3....2...-3....0...-3....0....1....2...-1....2...-1...-2
%e .-3...-2....3....2...-2....3....1....2....1....2...-3...-1...-3...-1....0....0
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 20 2012
| 