cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

0, 0, 1, 4, 31, 146, 961, 3662, 18444, 69848, 326102, 1330424, 6299674, 26712358, 124560630, 533971782, 2439626795, 10546384942, 47745529864, 208543550082, 940653815829, 4138965244350, 18611240779758, 82249270808254
Offset: 1

Views

Author

R. H. Hardin, Oct 25 2015

Keywords

Comments

Column 5 of A263764.

Examples

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

Crossrefs

Cf. A263764.