The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A211747 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 one, two, three, four, five, six or seven distinct values for every i,j,k<=n 0

%I

%S 49,343,1869,8659,35643,136121,494477,1736395,5955985,20088311,

%T 66948523,221182827,726211221,2373978133,7736949745,25168197671,

%U 81775419193

%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 one, two, three, four, five, six or seven distinct values for every i,j,k<=n

%e Some solutions for n=5

%e .-1....3...-3...-1....0....2...-3....0...-1...-3...-1....1....3....1....2...-2

%e .-2...-1....0...-2....1...-2...-1....3....2....0...-1...-1...-1...-3....2....1

%e .-3....3...-3....1....0....1....3...-3....1...-2...-1...-3....3....3...-1....3

%e ..3....1...-1...-2....3...-1....0...-1....0....0....3....3...-1....0....1....1

%e ..1...-2....2....2...-3....3...-1....0....0...-3...-2....1....1....3...-3...-2

%e ..3...-1...-1...-1...-2...-2...-3...-1...-2....1....2....0....1....0....1....0

%K nonn

%O 1,1

%A _R. H. Hardin_ Apr 20 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 19 23:59 EDT 2022. Contains 356231 sequences. (Running on oeis4.)