|
|
A007767
|
|
Number of pairs of permutations of degree n that avoid (12,21).
|
|
4
|
|
|
1, 1, 3, 17, 151, 1899, 31711, 672697, 17551323, 549500451, 20246665349, 864261579999, 42190730051687, 2329965898878307, 144220683681814515, 9926440976428215117, 754465679498026783923, 62939664181821196179459, 5732069150321309755351161, 567176164248814234096702451
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
A pair of permutations (p,q) of degree n avoid (12,21) if there do not exist indices 1<=i<j<=n such that p_i < p_j and q_j < q_i. - Noam 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
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
(Java) See link.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|