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.

Previous Showing 11-12 of 12 results.

A321056 Number of permutations of [n] with no fixed points where the maximal displacement of an element equals ten.

Original entry on oeis.org

0, 2803418, 49942371, 605109972, 6030258697, 53315654282, 437476633564, 3434708277908, 26357552759183, 200667318966580, 1531612782695209, 11845709562106324, 93455676821980373, 746513630305265464, 6002963117390580668, 48383934184947635708, 389641866674965457439
Offset: 10

Views

Author

Alois P. Heinz, Oct 26 2018

Keywords

Crossrefs

Column k=10 of A259784.

Formula

a(n) = A259783(n) - A259782(n).

A259785 Number of permutations p of [2n] with no fixed points where the maximal displacement of an element equals n.

Original entry on oeis.org

1, 1, 3, 44, 1285, 59963, 4113244, 389384029, 48627012403, 7743988554848, 1531612782695209, 368303149768896363, 105818590347793426632
Offset: 0

Views

Author

Alois P. Heinz, Jul 05 2015

Keywords

Examples

			a(0) = 1: (the empty permutation).
a(1) = 1: 21.
a(2) = 3: 2413, 3142, 3412.
a(3) = 44: 214563, 215643, 216345, ..., 451623, 452163, 456123.
		

Crossrefs

Cf. A259784.

Formula

a(n) = A259784(2n,n).
Previous Showing 11-12 of 12 results.