A263784 Number of length n arrays of permutations of 0..n-1 with each element moved by -5 to 5 places and exactly two more elements moved upwards than downwards.
0, 0, 0, 1, 5, 66, 267, 1721, 6618, 35203, 144762, 741173, 3224052, 16013645, 70410201, 336946471, 1484278684, 6936580487, 30771798007, 142201264901, 634570792805, 2910183388216, 13025117664481, 59369311030590
Offset: 1
Keywords
Examples
Some solutions for n=7 ..5....5....5....4....5....1....5....4....5....3....2....0....0....4....2....5 ..0....6....0....0....1....6....1....6....6....0....6....3....6....0....0....1 ..1....2....4....1....0....0....6....1....2....6....1....1....2....5....1....2 ..6....1....2....6....6....2....2....0....0....1....3....2....3....2....6....0 ..4....0....3....3....3....4....3....2....3....2....0....6....1....1....3....3 ..3....4....1....5....2....3....0....5....4....5....4....4....4....3....5....4 ..2....3....6....2....4....5....4....3....1....4....5....5....5....6....4....6
Links
- R. H. Hardin, Table of n, a(n) for n = 1..179
Crossrefs
Cf. A263787
Comments