Heng Cao, Haifeng Xi, et al.
WSC 2003
In this short note, we show a simple characterization of integers that reach records for a sequence described by adding binary strings to runs of 1's and 0's in a binary representation. In particular, we show that this set does not depend on the added strings as long as they are nonempty and of the same length.
Heng Cao, Haifeng Xi, et al.
WSC 2003
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence