|
|
A211749
|
|
Number of -3..3 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, six or eight distinct values for every i,j,k<=n
|
|
1
|
|
|
48, 230, 950, 3632, 13422, 48542, 173584, 620100, 2210560, 7933738, 28500322, 103284630, 374776104, 1371409876, 5022197054, 18526229324, 68352157746, 253717012028, 941511432258, 3511229532198, 13087482838170, 48979882211566
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=5
.-1...-1...-1...-3....3....0....3...-3...-3....0....2...-1....1...-1....2....2
..2...-3...-2...-2....3....1....1...-1....0...-3....0....0....2...-1....1....3
.-1...-2...-2....3....0...-2...-2....2...-3....0....3...-2....0...-1....3....3
..2....0...-2....2....1...-1....3...-3...-2...-1....2...-3....1...-3....1...-2
..3...-3....0....2....2....2....3...-3...-2....2....1...-3....2...-1....3....3
..2...-2...-2....3....3....3....3...-3...-1...-3....1....0....1....0....0....2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|