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.

A263902 Number of length n arrays of permutations of 0..n-1 with each element moved by -5 to 5 places and the total absolute value of displacements not greater than 2*(n-1).

Original entry on oeis.org

1, 2, 6, 20, 76, 300, 1189, 4701, 18754, 75243, 303407, 1227560, 4981002, 20260788, 82579632, 337175123, 1378826528, 5646408697, 23151632776, 95034718893, 390504864746, 1606102645910, 6611314522432, 27235758104621, 112279739875866
Offset: 1

Views

Author

R. H. Hardin, Oct 29 2015

Keywords

Comments

Column 5 of A263905.

Examples

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

Crossrefs

Cf. A263905.