|
|
A263682
|
|
Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and with no two consecutive decreases.
|
|
1
|
|
|
1, 2, 5, 17, 70, 349, 2017, 13358, 85403, 514631, 2892717, 15496398, 80361985, 412478090, 2110690179, 10938840527, 57413943808, 304300790810, 1621734608963, 8661768091020, 46243202420814, 246483106624494, 1310659258937117
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=7
..2....5....1....0....1....2....4....0....2....3....6....2....1....6....6....5
..6....1....0....5....2....4....1....3....3....1....0....5....3....4....1....0
..1....3....2....6....3....0....6....2....5....4....1....0....0....5....4....4
..4....6....3....3....6....6....0....4....0....6....5....4....6....1....2....6
..3....2....4....4....4....1....2....6....1....0....3....1....2....2....5....1
..5....4....5....1....5....3....5....1....4....2....4....6....5....3....0....2
..0....0....6....2....0....5....3....5....6....5....2....3....4....0....3....3
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|