Useful Links
Mathematics
Combinatorics
1. Introduction to Combinatorics
2. Fundamental Counting Principles
3. Permutations
4. Combinations
5. The Binomial Theorem
6. Advanced Counting Techniques
7. Recurrence Relations
8. Generating Functions
9. Special Counting Numbers and Sequences
10. Graph Theory and Combinatorics
11. Design Theory
12. Probabilistic Combinatorics
13. Algebraic Combinatorics
14. Extremal Combinatorics
15. Applications and Advanced Topics
Special Counting Numbers and Sequences
Catalan Numbers
Definition and First Values
Recurrence Relation
Closed-Form Formula
Generating Function
Combinatorial Interpretations
Balanced Parentheses
Dyck Paths
Binary Trees
Triangulations of Polygons
Mountain Ranges
Non-Crossing Partitions
Generalizations
Stirling Numbers
Stirling Numbers of the First Kind
Definition and Notation
Unsigned Stirling Numbers
Signed Stirling Numbers
Connection to Permutation Cycles
Recurrence Relations
Generating Functions
Stirling Numbers of the Second Kind
Definition and Notation
Connection to Set Partitions
Recurrence Relations
Generating Functions
Bell Numbers
Definition and Properties
Bell Triangle
Exponential Generating Function
Dobinski's Formula
Integer Partitions
Definition and Basic Properties
Partition Function p(n)
Ferrers Diagrams
Young Tableaux
Conjugate Partitions
Restricted Partitions
Partitions into Distinct Parts
Partitions into Odd Parts
Partitions with Bounded Parts
Generating Functions for Partitions
Partition Identities
Euler's Partition Theorem
Pentagonal Number Theorem
Other Important Sequences
Fibonacci Numbers
Lucas Numbers
Tribonacci Numbers
Pell Numbers
Motzkin Numbers
Narayana Numbers
Previous
8. Generating Functions
Go to top
Next
10. Graph Theory and Combinatorics