Abstract
Let d+, d+ be positive integers with d+≤ d+. We investigate the possibility of writing a positive integer n as the sum of an increasing sequence of positive integers such that the first term is at most d+ and the difference between consecutive terms lies between d+ and d+. We establish a recurrence relation to enumerate the sequences with given sum and last term and derive methods for constructing all such sequences with a given sum.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Barry and D.F. Robinson, Optimal batch sizes for urgent dispatch. (to appear).
C. Berge, Principles of Combinatorics. Academic Press, New York and London, 1971.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag
About this paper
Cite this paper
Robinson, D.F. (1976). Integer sequences with given sum and restricted differences. In: Casse, L.R.A., Wallis, W.D. (eds) Combinatorial Mathematics IV. Lecture Notes in Mathematics, vol 560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0097380
Download citation
DOI: https://doi.org/10.1007/BFb0097380
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08053-4
Online ISBN: 978-3-540-37537-1
eBook Packages: Springer Book Archive