|
|
A250645
|
|
Number of length n+1 0..7 arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero
|
|
0
|
|
|
1, 232, 296, 10766, 56088, 812004, 6290716, 61126790, 491825108, 4180573372, 33502889991, 273041099842, 2183663605890, 17568263304218, 140464317638347, 1125725667836824, 9002272474197863, 72061032003482452, 576368920287459218
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=5
..4....1....0....7....1....0....2....2....0....0....5....6....5....1....0....6
..4....1....3....3....0....6....2....5....4....2....7....4....3....4....3....7
..4....5....5....5....4....1....6....3....3....6....6....5....1....5....5....3
..1....7....3....4....6....3....1....7....3....5....4....2....7....7....4....0
..1....4....0....3....3....4....1....0....3....3....4....3....2....2....3....1
..3....4....0....0....3....7....1....4....6....0....4....3....0....5....7....2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|