|Journal of Integer Sequences, Vol. 22 (2019), Article 19.4.6|
Department of Statistics
University of Washington
Seattle, WA 98195
In this paper we consider the question of how close we can come to a three-part Beatty partition by considering "almost" Beatty sequences, that is, sequences that represent small perturbations of an "exact" Beatty sequence. We first characterize all cases in which there exists a partition into two exact Beatty sequences and one almost Beatty sequence with given densities, and we determine the approximation error involved. We then give two general constructions that yield partitions into one exact Beatty sequence and two almost Beatty sequences with prescribed densities, and we determine the approximation error in these constructions. Finally, we show that in many situations these constructions are best-possible in the sense that they yield the closest approximation to a three-part Beatty partition.
(Concerned with sequences A000201 A003144 A003145 A003146 A003623 A004919 A004976 A158919 A277722 A277723 A277728.)
Received October 5 2018; revised version received July 3 2019. Published in Journal of Integer Sequences, July 7 2019.