login
A211586
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 three, four, five, six or seven distinct values for every i,j,k<=n.
1
16, 52, 168, 516, 1560, 4588, 13272, 37788, 106040, 294836, 810304, 2215196, 6001792, 16214140, 43504736, 116571316, 310736008, 828017772, 2197752008, 5835140044, 15446573864, 40919565540, 108157976240, 286166447228
OFFSET
1,1
LINKS
EXAMPLE
Some solutions for n=5
.-2....0....1....2....2...-1....0....1...-2...-2....2...-2...-1....0....2...-2
..0....2....0...-1....1....2...-2....2....0....1...-1....0....2....1....1...-1
.-1....1....2...-2....0....0....1....0....1....0....2....1...-1....0...-2....0
..0...-2....0...-1....2...-2....2....2....0....2....0....0....2....2....0...-2
.-1....0...-2....2....1....0....1....1...-1....1....1...-1....1....1...-1...-1
..2...-2....0....1....0....1...-2....2....0....0....0....2...-2...-2....0....0
CROSSREFS
Sequence in context: A235653 A354886 A087701 * A232509 A087973 A351584
KEYWORD
nonn
AUTHOR
R. H. Hardin, Apr 16 2012
STATUS
approved