|
%I #4 Apr 20 2012 08:23:34
%S 36,154,576,2024,6800,22568,73472,240760,780588,2570304,8389972,
%T 27928068,92072644,310034916,1031933696,3509571076,11773984392,
%U 40357220784,136211521048,469619503208,1592083419460,5512376842976,18747568314652
%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 four, six, seven or eight distinct values for every i,j,k<=n
%H R. H. Hardin, <a href="/A211757/b211757.txt">Table of n, a(n) for n = 1..37</a>
%e Some solutions for n=5
%e ..3...-2...-2....2...-2...-3...-2...-1....1....2....3...-3....0...-3...-1....0
%e .-2....1...-1....0...-1...-2....1...-2....2...-3....2....2....1...-1....0....1
%e ..3....2....3....2...-3...-1...-2...-1....1...-2....1...-1....2....0...-1....3
%e ..0...-1....2....0...-1...-2....3....3....2....3....2...-3....3...-1...-2....2
%e .-3...-2...-1....3...-3...-3...-2...-2....0....2....1...-1...-2....0...-1....3
%e .-2....3....2...-2...-2...-2....3...-1....2....3....2....2...-3...-2....2....1
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 20 2012
| 