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

0, 0, 1, 4, 19, 50, 165, 476, 1543, 4544, 14108, 41666, 127313, 379674, 1152233, 3448844, 10424890, 31290646, 94453041, 284071264, 857114281, 2581411140, 7789677889, 23486717204, 70901078303, 213968862304, 646246694302

Offset: 1

Author

R. H. Hardin, Oct 25 2015

Keywords

• nonn

Comments

Column 3 of A263764

Examples

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

Links

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

Crossrefs

Cf. A263764