|
|
A263681
|
|
Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and with no two consecutive decreases.
|
|
1
|
|
|
1, 2, 5, 17, 70, 349, 2017, 11253, 58743, 286327, 1331630, 6077344, 27523597, 126333667, 587717372, 2760990038, 13033515692, 61583867944, 290639649211, 1368090247852, 6426462715392, 30151737816899, 141417395713905
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=7
..1....4....1....3....3....2....1....2....0....0....5....0....0....3....2....2
..0....5....6....6....5....6....0....5....5....2....6....1....1....1....6....0
..5....0....4....0....6....1....3....0....1....5....1....3....6....5....3....1
..6....1....5....2....0....4....2....1....4....6....3....4....4....0....5....6
..2....6....2....4....1....3....4....3....6....3....0....6....5....6....1....3
..3....2....3....1....2....5....5....4....2....4....2....2....2....2....4....4
..4....3....0....5....4....0....6....6....3....1....4....5....3....4....0....5
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|