|
%I
%S 25,125,513,1761,5489,16203,46083,128451,352585,961381,2606233,
%T 7062319,19117091,51884109,141012935,384802181,1052871153,2893966015,
%U 7980178693,22106320631,61443947479,171516628195,480331192429,1350382485499
%N Number of -2..2 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="/A211595/b211595.txt">Table of n, a(n) for n = 1..31</a>
%e Some solutions for n=5
%e ..0...-1...-2....2....0...-1....1....1...-2...-2...-2...-1....2...-1....2....1
%e ..0...-2...-2....1...-1....1....1....2...-2....2....1...-1...-2....0....2....1
%e ..0...-2...-2....2....0....0....0...-2...-1....2...-2....1...-2...-1....2....2
%e .-2...-1....0....0....0....0....1....2....1...-2....1...-1...-1...-2....0....2
%e .-1....0...-2....1...-1....0....2...-2....2....0....1...-1....1....0....1....2
%e .-2...-1...-2....0...-2....0....1...-1....1...-2....1...-2...-1....2....0....0
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 16 2012
|
