[go: up one dir, main page]

login
A263786
Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and exactly two more elements moved upwards than downwards
1
0, 0, 0, 1, 5, 66, 392, 4859, 26994, 232208, 1161998, 8246455, 41787717, 274395962, 1457963344, 9504972075, 53127306403, 343749866061, 1960779086021, 12451275397390, 71531553827855, 445155989823862, 2568693912325240
OFFSET
1,5
COMMENTS
Column 7 of A263787
LINKS
EXAMPLE
Some solutions for n=7
..6....6....0....4....6....6....5....3....2....6....5....0....6....4....5....6
..0....1....6....0....4....5....6....0....0....5....4....5....1....0....0....1
..5....2....1....5....1....1....2....6....6....2....1....1....5....1....6....4
..2....0....5....2....2....2....0....1....1....0....2....2....0....6....1....2
..4....3....2....1....3....4....3....4....3....3....0....4....3....3....4....0
..1....5....3....3....5....3....1....2....5....1....3....3....2....5....3....3
..3....4....4....6....0....0....4....5....4....4....6....6....4....2....2....5
CROSSREFS
Sequence in context: A183899 A263784 A263785 * A169934 A162443 A219678
KEYWORD
nonn
AUTHOR
R. H. Hardin, Oct 26 2015
STATUS
approved