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!)
A211585 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, four, five, six or seven distinct values for every i,j,k<=n 1
24, 108, 350, 962, 2458, 5996, 14108, 32866, 74604, 170544, 381234, 866296, 1927712, 4384998, 9772806, 22344402, 50050666, 115292422, 260040134, 604224496, 1373323994, 3220149132, 7375767952, 17449609076, 40261731480, 96052427846 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
Some solutions for n=5
.-2...-2....1....0....1...-2...-2....0...-1....1....2...-1....0....2...-1...-2
.-1....0...-1....1....0...-2...-2....2...-2....0...-2....1...-2...-2...-1...-1
..2...-2...-1...-2....1...-2....1....0....1....1...-1...-1....0....0...-1....2
..1....0....0....1....2....2...-1....1....2...-1....0...-1...-1...-2....0...-1
..0...-2...-1....0....1...-1....1....0...-1...-2...-1....1...-2....2...-1....0
..1...-1...-1....1....0....0...-1....2....2...-1....2...-2....2....1....1....1
CROSSREFS
Sequence in context: A211577 A101862 A211591 * A211599 A282211 A103473
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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)