## You are here

HomeWedderburn-Etherington number

## Primary tabs

# Wedderburn-Etherington number

The $n$th Wedderburn-Etherington number counts how many weakly binary trees can be constructed such that each graph vertex (not counting the root vertex) is adjacent to no more than three other such vertices, for a given number $n$ of nodes. The first few Wedderburn-Etherington numbers are 1, 1, 1, 2, 3, 6, 11, 23, 46, 98, 207, 451, 983, etc. listed in A001190 of Sloane’s OEIS. Michael Somos gives the following recurrence relations:

$a_{{2n}}=\frac{1}{2}a_{n}a_{{n+1}}+\sum_{{i=1}}^{n}a_{i}a_{{2n-i}}$ |

and

$a_{{2n-1}}=\sum_{{i=0}}^{{n-1}}a_{{i+1}}a_{{2n-i}}$ |

with $a_{1}=a_{2}=1$ in both relations.

Synonym:

Wedderburn Etherington number, Etherington-Wedderburn number

Type of Math Object:

Definition

Major Section:

Reference

## Mathematics Subject Classification

05A15*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff
- Corrections