Counting number of factorizations of a natural number
arXiv:0811.3479
Abstract
In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.