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.

A007767 Number of pairs of permutations of degree n that avoid (12,21).

Original entry on oeis.org

1, 1, 3, 17, 151, 1899, 31711, 672697, 17551323, 549500451, 20246665349, 864261579999, 42190730051687, 2329965898878307, 144220683681814515, 9926440976428215117, 754465679498026783923, 62939664181821196179459, 5732069150321309755351161, 567176164248814234096702451
Offset: 0

Views

Author

Keywords

Comments

A pair of permutations (p,q) of degree n avoid (12,21) if there do not exist indices 1<=iNoam Zeilberger, Jun 06 2016 (via Steve Linton)
Number of intervals (i.e. ordered pairs (x,y) such that x<=y) in the permutation lattice of size n, that is, pairs of permutations (x,y) related by the weak Bruhat order x<=y iff inversions(x) is a subset of inversions(y) (see Hammett and Pittel, p. 4567). - Noam Zeilberger, Jun 01 2016

Crossrefs

Programs

  • Java
    // See Kapun link.

Formula

a(n) = Sum_{k=1..n!} k * A263754(n,k). - Alois P. Heinz, Jun 06 2016

Extensions

a(0)=1 prepended by Alois P. Heinz, Jun 06 2016
a(10)-a(13) from Evgeny Kapun, Dec 11 2016
More terms from Andrew Elvey Price, Feb 08 2024