A263782 Number of length n arrays of permutations of 0..n-1 with each element moved by -3 to 3 places and exactly two more elements moved upwards than downwards.

0, 0, 0, 1, 2, 10, 31, 134, 439, 1604, 5088, 17115, 54199, 176073, 552856, 1755516, 5472509, 17149688, 53191180, 165306987, 510614655, 1578127066, 4859554763, 14963066678, 45966984378, 141165413462, 432876102395, 1326862831744

Offset: 1

Author

R. H. Hardin, Oct 26 2015

Keywords

• nonn

Comments

Column 3 of A263787

Examples

			Some solutions for n=7
..3....3....0....0....3....2....0....0....2....1....0....3....3....3....0....0
..0....0....1....2....0....0....4....4....1....0....4....0....0....0....4....1
..5....1....5....1....2....5....1....1....0....5....1....1....1....1....1....2
..1....2....2....6....6....1....6....2....6....2....2....6....2....6....2....6
..2....5....3....3....1....3....2....6....3....3....3....2....4....4....3....3
..4....4....4....4....4....4....3....3....4....4....5....5....6....2....6....4
..6....6....6....5....5....6....5....5....5....6....6....4....5....5....5....5
		

Links

• R. H. Hardin, Table of n, a(n) for n = 1..210

Crossrefs

Cf. A263787