|
%I
%S 24,108,294,702,1560,3464,7448,16498,35766,80586,178192,410044,925128,
%T 2169774,4976710,11850650,27515436,66271404,155211372,376977262,
%U 888276502,2170805230,5137041172,12612008268,29937248660,73756347602
%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 two, four, five or six distinct values for every i,j,k<=n
%H R. H. Hardin, <a href="/A211577/b211577.txt">Table of n, a(n) for n = 1..37</a>
%e Some solutions for n=5
%e ..2...-2....0...-1...-2...-1....1...-1...-2....0....1....1....1...-2....2...-2
%e .-1...-2...-1...-1....2...-1....0....1...-2....1....1....2...-2...-1....0....0
%e .-2....1...-2...-1...-2....1...-1...-1...-1...-2....2....1....2....2...-2...-1
%e ..1...-2...-1...-2....2....1....2....0....0....1....2....0....2....1...-1...-2
%e ..0...-2...-2...-2...-2....1...-1...-1...-1...-2....2....1...-2....2...-2....0
%e .-1...-2...-2...-1...-1...-1....0....2....0...-1....1...-1....2....1....0...-2
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 16 2012
|
