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

%I

%S 37,199,1053,5535,28861,149511,769781,3941903,20086873,101907051,

%T 514956973,2592873483,13013271697,65120894871,325014728269,

%U 1618235038823,8039558463221,39862180531911,197290335346541,974846972091527

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

%H R. H. Hardin, <a href="/A211765/b211765.txt">Table of n, a(n) for n = 1..35</a>

%e Some solutions for n=5

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

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

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

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

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

%e ..0....3....0....0....0....2....0...-1...-2...-2...-2....2....2....1....0....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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 22:37 EDT 2022. Contains 353724 sequences. (Running on oeis4.)