Nine classes of permutations enumerated by binomial transform of Fine's sequence
From MaRDI portal
Publication:2357779
Recommendations
- Finite transition matrices for permutations avoiding pairs of length four patterns
- Enumeration of permutations avoiding a triple of 4-letter patterns is almost all done
- Enumeration of small Wilf classes avoiding 1342 and two other 4-letter patterns
- Enumeration of small Wilf classes avoiding 1324 and two other 4-letter patterns
- Two permutation classes enumerated by the central binomial coefficients
Cites work
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A stack and pop stack in series
- Classification of forbidden subsequences of length 4
- Egge triples and unbalanced Wilf equivalence
- Forbidden subsequences
- Generating trees and the Catalan and Schröder numbers
- OEIS
- Restricted permutations
- Simple permutations and algebraic generating functions
- Skew Dyck paths
- Sorting classes
- The On-Line Encyclopedia of Integer Sequences
- The kernel method and systems of functional equations with several conditions
Cited in
(3)
This page was built for publication: Nine classes of permutations enumerated by binomial transform of Fine's sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357779)