The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A211762 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, seven or eight distinct values for every i,j,k<=n 1

%I #4 Apr 20 2012 08:26:38

%S 36,170,744,3058,12048,45768,170020,618088,2217032,7850692,27545188,

%T 95924784,331693024,1142415700,3911185396,13370835896,45462050832,

%U 154638073332,523283349484,1774064765080,5983947707352,20245716124732

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

%H R. H. Hardin, <a href="/A211762/b211762.txt">Table of n, a(n) for n = 1..26</a>

%e Some solutions for n=5

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

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

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

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

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

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

%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 13 21:17 EDT 2024. Contains 372523 sequences. (Running on oeis4.)