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!)
A211734 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 or six distinct values for every i,j,k<=n 1

%I

%S 37,199,677,1955,5323,14313,37885,102041,273511,749531,2046981,

%T 5707517,15836459,44772949,125719807,359222809,1017627511,2931555923,

%U 8360495347,24240841339,69495187871,202554449245,583137465157,1706970835321

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

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

%e Some solutions for n=5

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

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

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

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

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

%e ..2....0....0....0....0....2....1...-3....0...-1...-2...-2...-3...-3....1...-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 January 17 19:55 EST 2022. Contains 350406 sequences. (Running on oeis4.)