|
|
A250644
|
|
Number of length n+1 0..6 arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero
|
|
1
|
|
|
1, 161, 219, 5901, 28379, 332827, 2225195, 18399217, 129137886, 953809557, 6704767056, 47777146765, 335147823244, 2360792885729, 16540740396740, 116054610957529, 812699929957712, 5694036707961181, 39865043590813086
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=5
..6....4....1....2....3....4....4....2....3....0....4....3....6....4....6....3
..4....1....0....0....1....6....0....1....6....2....5....1....0....3....4....1
..4....1....3....0....4....1....1....5....2....0....3....1....3....0....2....0
..0....0....4....5....3....5....3....0....0....0....6....3....5....3....0....0
..4....2....6....2....2....2....5....4....0....2....0....2....3....0....6....0
..6....6....1....1....1....2....5....0....2....1....2....2....1....5....5....4
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|