Enumerative combinatorics
Non-overlapping partitions, continued fractions, bessel functions and divergent series
European Journal of Combinatorics
New modular properties of bell numbers
Journal of Combinatorial Theory Series A
Discrete Mathematics
Counting pattern-free set partitions I: a generalization of Stirling numbers of the second kind
European Journal of Combinatorics
Discrete Mathematics
On the number of chord diagrams
Discrete Mathematics
Generating functions for generating trees
Discrete Mathematics
Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings
Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
The On-Line Encyclopedia of Integer Sequences
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Journal of Combinatorial Theory Series A
Journal of Symbolic Computation
Partitions and partial matchings avoiding neighbor patterns
European Journal of Combinatorics
Multi-route query processing and optimization
Journal of Computer and System Sciences
Hi-index | 0.00 |
We prove that the ordinary generating function of Bell numbers satisfies no algebraic differential equation over C(x) (in fact, over a larger field). We investigate related numbers counting various set partitions (the Uppuluri-Carpenter numbers, the numbers of partitions with j mod i blocks, the Bessel numbers, the numbers of connected partitions, and the numbers of crossing partitions) and prove for their ogf's analogous results. Recurrences, functional equations, and continued fraction expansions are derived.