|
%I #4 Apr 16 2012 06:55:45
%S 25,125,457,1353,3771,10123,26785,70815,187485,501357,1349215,3674445,
%T 10074585,27914969,77778359,218513889,616455627,1749899177,4982262575,
%U 14249870589,40844847989,117464523359,338353979903,977015700789
%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 or six distinct values for every i,j,k<=n
%H R. H. Hardin, <a href="/A211581/b211581.txt">Table of n, a(n) for n = 1..33</a>
%e Some solutions for n=5
%e .-2....1...-1....0....1...-2...-1....0....1....0....1....1....0...-1....0...-2
%e .-1....0....0...-1....0....1...-1....0....2....1....1...-1...-1....0....1....0
%e ..0....1...-1....1...-2....0...-1....2....1....2....1....1....1...-1....1...-1
%e .-2....0...-1...-1....0....1....1....0....0....1....1....0....1...-1....0...-2
%e ..0....0...-2...-2....1....0....1....2...-1....1...-1....0....1....0....0...-1
%e .-1....0...-1....0....2....0...-1....2...-2....1....1...-1....1....0...-2...-2
%K nonn
%O 1,1
%A _R. H. Hardin_ Apr 16 2012
|
