Enumeration of \(M\)-partitions (Q2488946)

Let \(\lambda=(\lambda_0,\dots,\lambda_n)\) be a partition of the positive integer \(m\) into \(n+1\) parts such that \(i<j\) implies \(\lambda_i \leq\lambda_j\). Call \(\lambda\) an \(M\)-partition if every positive integer below \(m\) can be represented as a sum of a minimal number of parts from \(\lambda\). (For example, the \(M\)-partitions of 5 are \((1,1,3)\) and \((1,2,2)\).) Let \(a(m)\) denote the number of \(M\)-partitions of \(m\). The author develops a formula for \(a(m)\), thereby extending an earlier result by O'Shea.