login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


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

%I

%S 36,170,700,2514,8560,27982,89548,285758,904484,2902906,9275824,

%T 30262878,98205732,326091006,1073931604,3619422754,12061454552,

%U 41110563674,138187882940,474813999142,1605753547660,5548416543766,18842697824824

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

%H R. H. Hardin, <a href="/A211751/b211751.txt">Table of n, a(n) for n = 1..41</a>

%e Some solutions for n=5

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

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

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

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

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

%e ..1....0....0...-3....2....2...-1...-1....3....2...-1....3...-1...-1...-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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 23 21:09 EDT 2021. Contains 345402 sequences. (Running on oeis4.)