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!)
A211763 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, four, five, six, seven or eight distinct values for every i,j,k<=n 0

%I #3 Apr 20 2012 08:27:02

%S 48,306,1732,9066,44218,203952,901938,3863236,16173336,66608806,

%T 271211310,1096118176,4408568100,17688124818,70884256140

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

%e Some solutions for n=5

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

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

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

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

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

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

%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 April 24 13:49 EDT 2024. Contains 371958 sequences. (Running on oeis4.)