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.
This is the publisher's version of the work. This publication appears in Gettysburg College's institutional repository by permission of the copyright owner for personal use, not for redistribution.
Glass, Darren B. "Composition of Integers with Bounded Parts." Integers 14 (2014), #A6.
Required Publisher's Statement
Original version is available from the publisher at: http://www.integers-ejcnt.org/