  In this note, we consider ordered partitions of integers such that each entry
is no more than a fixed portion of the sum. We give a method for constructing
all such compositions as well as both an explicit formula and a generating
function describing the number of $k$-tuples whose entries are bounded in this
way and sum to a fixed value $g$.
