The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size! (Q1356119): Difference between revisions

@@ Property / cites work @@
+Permutations with one or two 132-subsequences
@@ Property / cites work: Permutations with one or two 132-subsequences / rank @@
+Normal rank
@@ Property / cites work @@
+Permutations avoiding certain patterns: The case of length 4 and some generalizations
+Normal rank
@@ Property / cites work @@
+Pattern matching for permutations
@@ Property / cites work: Pattern matching for permutations / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric functions and P-recursiveness
@@ Property / cites work: Symmetric functions and P-recursiveness / rank @@
+Normal rank
@@ Property / cites work @@
+The number of permutations containing exactly one increasing subsequence of length three
+Normal rank
@@ Property / cites work @@
+Restricted permutations
@@ Property / cites work: Restricted permutations / rank @@
+Normal rank
@@ Property / cites work @@
+Differentiably finite power series
@@ Property / cites work: Differentiably finite power series / rank @@
+Normal rank
@@ Property / cites work @@
+The enumeration of permutations with a prescribed number of ``forbidden'' patterns
+Normal rank
@@ Property / cites work @@
+A holonomic systems approach to special functions identities
+Normal rank