Arrangements and Combinations · Catalan Numbers: Introduction
Lesson 6
Problem. Let \(E(n)\) be the number of rooted trees with exactly \(n\) edges. For example, \(E(3)=5\):
What is \(E(4)\)?
Arrangements and Combinations · Catalan Numbers: Introduction
Problem. Let \(E(n)\) be the number of rooted trees with exactly \(n\) edges. For example, \(E(3)=5\):
What is \(E(4)\)?