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

 

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

%I

%S 48,330,1764,7968,31786,117270,410460,1386380,4570334,14808240,

%T 47415150,150559236,475404140,1495840120,4696349418,14732952836,

%U 46209158636,145045251938,455701735566

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

%e Some solutions for n=5

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

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

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

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

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

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

%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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 4 20:08 EDT 2022. Contains 355086 sequences. (Running on oeis4.)