login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


A211599
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, seven or eight distinct values for every i,j,k<=n
1
24, 108, 398, 1378, 4458, 13916, 42036, 124830, 364224, 1054104, 3021982, 8631468, 24531936, 69625326, 197129902, 558033010, 1578078446, 4464721270, 12628681890, 35747573656, 101207342666, 286778663632, 812918632000, 2306299075524
OFFSET
1,1
LINKS
EXAMPLE
Some solutions for n=5
..2...-2...-2...-1...-2...-1...-2....2...-1....0....1...-2....2....2....0....0
.-1...-2....1....1....2...-1...-1....1....2...-2...-2...-2...-1....0...-1...-1
..1....0...-1....2...-2....1...-2...-2....1...-2...-2...-2....2...-2....2...-2
..2...-1...-1...-1....0...-2...-2....1....0....0....1...-1....2...-1....2...-1
..2...-1...-1....1...-2...-1....1....2...-1...-1...-2....0....2...-2....1....2
.-1...-2...-1....2...-2...-2....2....2....0...-1....0...-2....2...-1....2...-1
CROSSREFS
Sequence in context: A101862 A211591 A211585 * A282211 A103473 A162451
KEYWORD
nonn
AUTHOR
R. H. Hardin Apr 16 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 20 18:47 EDT 2024. Contains 376075 sequences. (Running on oeis4.)