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!)
A211764 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 three, four, five, six, seven or eight distinct values for every i,j,k<=n 1
36, 186, 944, 4764, 23824, 118360, 584192, 2867280, 14000960, 68054336, 329428048, 1588714080, 7636061184, 36590420768, 174849450144, 833428507648, 3963494947280, 18809675141312, 89095618484832, 421283134048224 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
Some solutions for n=5
..1....1....3....2....3....0...-1....0...-3....3...-3....2...-3....3....0....1
.-3...-3...-1....1....0...-1....0...-1...-2....0....0...-1....2....1....3....0
..1...-2....2...-3...-3....3...-2....2...-3...-3....1....2...-1...-2...-1....2
.-3....1...-3....2....2...-1...-1....1...-2....1...-2...-1....0...-1....3....0
..1....0...-2....0....3....2...-3....0...-3....0....1....2...-1....2...-1...-2
.-3...-2....3....2...-2....3....1....2....1....2...-3...-1...-3...-1....0....0
CROSSREFS
Sequence in context: A211733 A211744 A211753 * A255093 A017138 A339981
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 July 9 04:17 EDT 2024. Contains 374171 sequences. (Running on oeis4.)