The paper demonstrates how to apply a recursion on the fundamental concept of number. We propose a generalization of the partitions of a positive integer n, by defining new combinatorial objects, namely sub-partitions. A recursive formula is suggested, designated to solve the associated enumeration problem. It is highlighted that sub-partitions provide a good language to study rooted phylogenetic trees.