07-03-2026, 04:57 PM
Wedderburn–Etherington number
Summary
The Wedderburn–Etherington numbers form a mathematical sequence that counts how many different ways you can build certain unordered binary trees, or equivalently how many ways you can fully parenthesize a product when the operation is commutative but not associative.
In simpler terms, they measure how many distinct “shapes” or structures you can get when combining identical elements in pairs without caring about order, such as different ways of grouping expressions like (x^n) or arranging single-elimination tournament brackets.
The sequence starts as $(1, 1, 1, 2, 3, 6, 11, 23, 46, \dots)$, and it grows quickly as (n) increases because the number of possible tree structures explodes combinatorially. These numbers appear in areas like graph theory, combinatorics, computer science, and even phylogenetics, wherever hierarchical branching structures are studied.
ARTICLE
Summary
The Wedderburn–Etherington numbers form a mathematical sequence that counts how many different ways you can build certain unordered binary trees, or equivalently how many ways you can fully parenthesize a product when the operation is commutative but not associative.
In simpler terms, they measure how many distinct “shapes” or structures you can get when combining identical elements in pairs without caring about order, such as different ways of grouping expressions like (x^n) or arranging single-elimination tournament brackets.
The sequence starts as $(1, 1, 1, 2, 3, 6, 11, 23, 46, \dots)$, and it grows quickly as (n) increases because the number of possible tree structures explodes combinatorially. These numbers appear in areas like graph theory, combinatorics, computer science, and even phylogenetics, wherever hierarchical branching structures are studied.
ARTICLE
┌────────────────────────────────┐
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘