Let be the sum-of-digits function in base , which returns the number of nonzero binary digits of a nonnegative integer . We study along arithmetic subsequences and show that — up to a shift — the set of -tuples of integers that appear as an arithmetic subsequence of has full complexity.
"The sum-of-digits function on arithmetic progressions." Mosc. J. Comb. Number Theory 9 (1) 43 - 49, 2020. https://doi.org/10.2140/moscow.2020.9.43