 An "irreducible tree" (or "series-reduced tree") is a tree in which there is no vertex of degree 2 (enumerated at sequence in the OEIS).A "forest" is an undirected graph in which any two vertices are connected by at most one path.Equivalently, a forest is an undirected acyclic graph.