In graph theory, the Wedderburn–Etherington numbers, named for Ivor Malcolm Haddon Etherington and Joseph Wedderburn, count how many weak binary trees can be constructed: that is, the number of trees for which each graph vertex (not counting the root) is adjacent to no more than three other such vertices, for a given number of node. The first few Wedderburn–Etherington numbers are