This paper describes the calculation of the marginal distribution of the degrees of nodes in a type of random tree called a k-minimal label recurrent tree, when the size of the tree is sufficiently large. The external degree of a node in a k-minimal label recurrent tree is equal to the number of customers that node attracts directly in a marketing pyramid scheme.
