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!)
A211754 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 or eight distinct values for every i,j,k<=n 1
37, 199, 893, 3323, 11273, 36159, 112703, 348665, 1071523, 3339079, 10404975, 33170833, 105676217, 345291137, 1123296141, 3746722541, 12390256743, 41963112457, 140402923347, 480591164385, 1620851816467, 5588010236041 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
Some solutions for n=5
..2...-1....0....0....3...-1....1...-2...-3....2....2....0....0....2...-1....0
.-3...-2...-3...-3....2....3...-2....3...-1....0...-3...-2....0....3....0...-2
.-2....1....0...-1....0....1...-1...-2....3....0...-2...-3...-1...-1...-3....1
.-1....2...-1...-2....3....3...-2....0...-1...-2...-3...-1....0....3...-2...-2
..2....1....2....0....2....0...-1....1....3....0...-2....0....2....2...-3...-3
..1....3...-3...-2....0....1....2....0....1...-2...-3...-3....3...-1....2...-1
CROSSREFS
Sequence in context: A141954 A211734 A211745 * A211765 A221888 A156569
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 17:50 EDT 2024. Contains 375753 sequences. (Running on oeis4.)