|
%I #4 Apr 20 2012 08:02:53
%S 48,306,1016,2722,6868,17054,41920,105654,267306,699930,1842080,
%T 5008110,13630092,38145758,106346040,303695658,860469558,2491030532,
%U 7134136098,20845113942,60132267140,176824000698,512627653118,1514185540302
%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, five or six distinct values for every i,j,k<=n
%H R. H. Hardin, <a href="/A211732/b211732.txt">Table of n, a(n) for n = 1..51</a>
%e Some solutions for n=5
%e ..3....1...-3...-2....0...-1....0....3....3...-3....1....3...-1....2...-3....2
%e ..2...-2...-3....1....2....0...-3....0...-2....0...-1....3....2....1....0....1
%e ..3...-1....1...-2....0...-3...-2....3....3...-1....1....2...-1....0...-3....1
%e ..0...-2....1...-3....2...-2....1....0...-2....0...-1....1....0....3...-3....2
%e ..3...-3...-3....0...-1...-1....2....1...-2...-3....1....2...-1....0...-3....1
%e ..0....0....1....3....2...-2...-1....0....3...-2...-3....2....1....3...-3....0
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 20 2012
| 