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!)
A211580 Number of -2..2 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 or six distinct values for every i,j,k<=n 1
24, 116, 396, 1108, 2954, 7640, 19676, 51060, 133728, 356546, 961630, 2639484, 7312996, 20540736, 58061306, 165704028, 474754182, 1368989652, 3956576274, 11483585258, 33373408392, 97258918906, 283647632398, 828748613072 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
Some solutions for n=5
.-2...-1...-2...-1....1....1....0....1...-2...-2....2....1....0...-2...-1....1
..0....2...-1....1....2....1....1...-1....2...-1...-2...-1....1...-2....2...-2
.-1....1...-2....0....2....1....0....0....1....1....2....0....2...-2...-1...-1
..1...-2...-2...-1....1....0...-1...-2...-1....2...-2....2....1...-2...-1...-2
.-1...-1...-1...-2....1...-2....2...-1....1....1....0....1....2...-1....2....1
..0...-2....0....0....0....0....1....0....2....0...-2....0...-2...-1...-1...-2
CROSSREFS
Sequence in context: A228433 A124952 A126411 * A211594 A211465 A371184
KEYWORD
nonn
AUTHOR
R. H. Hardin Apr 16 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 29 11:30 EDT 2024. Contains 372113 sequences. (Running on oeis4.)