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!)
A211746 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 two, three, four, five, six or seven distinct values for every i,j,k<=n 0
48, 330, 1764, 7968, 31786, 117270, 410460, 1386380, 4570334, 14808240, 47415150, 150559236, 475404140, 1495840120, 4696349418, 14732952836, 46209158636, 145045251938, 455701735566 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
Some solutions for n=5
.-1...-1....1...-2....1...-2....2...-3...-3....1...-1....3...-3....0....1...-2
..3....3....2....2....2....1...-1....3...-3....0....2...-3...-2....3....2....2
..2...-3....3....0...-2....2....2...-3....3...-1...-2....1...-3....0....0...-3
..3....2....3....2....0...-1....1....2....3...-3....0...-1....1....1....1....3
.-1....0....3....0....2....1....2...-1...-3...-2...-3....0....3...-1....0....1
..3...-2....2....2....0...-2....1....1....0...-3....0....3...-2....2...-1....3
CROSSREFS
Sequence in context: A280022 A223396 A211735 * A211755 A211504 A211766
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 April 19 09:23 EDT 2024. Contains 371782 sequences. (Running on oeis4.)