Asyrec
From MaRDI portal
Cited in
(20)- Effective bounds for P-recursive sequences
- Pattern avoidance in ordered set partitions
- Log-concavity of \(P\)-recursive sequences
- A combinatorial-probabilistic analysis of bitcoin attacks
- ACETAF
- Balls in boxes: variations on a theme of Warren Ewens and Herbert Wilf
- FindRec
- EKHAD
- BallsInBoxes
- RookWalks
- HERB
- TANGLE
- WILF
- Asymptotics
- SVT.txt
- Asymptotic Expansions
- The computational challenge of enumerating high-dimensional rook walks
- Crossings and nestings in colored set partitions
- Asymptotic \(r\)-log-convexity and P-recursive sequences
- The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic
This page was built for software: Asyrec