|
|
A211577
|
|
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 or six distinct values for every i,j,k<=n
|
|
1
|
|
|
24, 108, 294, 702, 1560, 3464, 7448, 16498, 35766, 80586, 178192, 410044, 925128, 2169774, 4976710, 11850650, 27515436, 66271404, 155211372, 376977262, 888276502, 2170805230, 5137041172, 12612008268, 29937248660, 73756347602
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=5
..2...-2....0...-1...-2...-1....1...-1...-2....0....1....1....1...-2....2...-2
.-1...-2...-1...-1....2...-1....0....1...-2....1....1....2...-2...-1....0....0
.-2....1...-2...-1...-2....1...-1...-1...-1...-2....2....1....2....2...-2...-1
..1...-2...-1...-2....2....1....2....0....0....1....2....0....2....1...-1...-2
..0...-2...-2...-2...-2....1...-1...-1...-1...-2....2....1...-2....2...-2....0
.-1...-2...-2...-1...-1...-1....0....2....0...-1....1...-1....2....1....0...-2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|