Abstract
It is known that, for given integers and j>0, the nested recursion has a closed-form solution for which a combinatorial interpretation exists in terms of an infinite, labelled tree. For s = 0, we show that this solution sequence has a closed form as the sum of ceiling functions