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!)
A211594 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, six or eight distinct values for every i,j,k<=n 1
24, 116, 448, 1472, 4444, 12774, 35650, 97884, 266054, 720836, 1948936, 5282998, 14342514, 39132978, 107104716, 294823440, 814517876, 2262919142, 6309912984, 17683751676, 49727073362, 140446174060, 397854724286, 1131186110662 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
Some solutions for n=5
..0...-1...-1....0....0...-1...-2...-1....1...-2....1....2....1....2....0...-1
..1....0...-2....1...-1...-2....0....2....0...-1....0....0...-1....2...-1...-2
.-2....2...-1....0....1...-1...-2....0...-1....1....1...-1...-1....0...-1....0
..1....0....0...-1....0....0...-2...-2...-1....0...-1....0...-2...-1...-1...-1
.-2...-2....1....1....1....2...-2....0...-1...-1....1....2...-2....0...-1....0
..1....0...-1....2....2....1...-2...-2...-2...-2....0....2....0...-1...-2....2
CROSSREFS
Sequence in context: A124952 A126411 A211580 * A211465 A371184 A371160
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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)