A263760 Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and exactly one more element moved upwards than downwards.
0, 0, 1, 4, 31, 106, 485, 1546, 6083, 21020, 83505, 298850, 1157277, 4174794, 15848043, 57833610, 218278105, 803890160, 3022404618, 11185043168, 41937855185, 155739217814, 583290598528, 2171877488824, 8131306069328
Offset: 1
Keywords
Examples
Some solutions for n=7 ..3....0....2....4....0....2....4....4....4....2....0....2....4....4....1....4 ..0....3....5....1....5....0....5....0....3....4....2....0....1....0....4....5 ..2....6....1....0....2....5....6....2....1....0....6....6....0....1....6....0 ..1....1....0....3....1....1....2....5....2....6....3....5....5....3....0....6 ..5....4....6....2....6....6....0....1....0....3....1....3....3....5....3....1 ..4....2....3....5....3....4....1....3....5....1....4....1....2....2....2....3 ..6....5....4....6....4....3....3....6....6....5....5....4....6....6....5....2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Crossrefs
Cf. A263764
Comments