A065410
Number of labeled, rooted, binary trees with internal nodes labeled from {1, …,n} and leaves labeled from {0,1} such that for any path from the root to a leaf, the internal nodes receive distinct labels. In other words, the number of decision trees on n Boolean variables.
offset: 0
codomain: ℕ
Declarations
Section titled “Declarations”- A065410computable