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
37, 199, 1053, 5535, 28861, 149511, 769781, 3941903, 20086873, 101907051, 514956973, 2592873483, 13013271697, 65120894871, 325014728269, 1618235038823, 8039558463221, 39862180531911, 197290335346541, 974846972091527 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
Some solutions for n=5
..2...-2....1....1....3....0....2....2...-3...-1....1...-2....0....3...-2....3
..3....3...-3....2....0....2....0....0...-1....0...-2....0....2...-2....1...-1
.-1....2...-1...-3....0...-3....0...-2....0....2....1....2....0....0....0....2
..0....3....3....0....1....0...-1....3....3....1...-3....1...-2....3...-2...-3
..3....1....1...-2....2...-1...-2...-2....0....3....0....0....0....2....0....0
..0....3....0....0....0....2....0...-1...-2...-2...-2....2....2....1....0....0
CROSSREFS
Sequence in context: A211734 A211745 A211754 * A221888 A156569 A141984
KEYWORD
nonn
AUTHOR
R. H. Hardin Apr 20 2012
STATUS
approved

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 September 8 10:21 EDT 2024. Contains 375753 sequences. (Running on oeis4.)