Recent Issues
Volume 14, Issue 2
Volume 14, Issue 1
Volume 13, Issue 4
Volume 13, Issue 3
Volume 13, Issue 2
Volume 13, Issue 1
Volume 12, Issue 4
Volume 12, Issue 3
Volume 12, Issue 2
Volume 12, Issue 1
Volume 11, Issue 4
Volume 11, Issue 3
Volume 11, Issue 2
Volume 11, Issue 1
Volume 10, Issue 4
Volume 10, Issue 3
Volume 10, Issue 2
Volume 10, Issue 1
Volume 9, Issue 4
Volume 9, Issue 3
Volume 9, Issue 2
Volume 9, Issue 1
Volume 8, Issue 4
Volume 8, Issue 3
Volume 8, Issue 2
Volume 8, Issue 1
Older Issues
Volume 7, Issue 4
Volume 7, Issue 3
Volume 7, Issue 2
Volume 7, Issue 1
Volume 6, Issue 4
Volume 6, Issue 2-3
Volume 6, Issue 1
Volume 5, Issue 4
Volume 5, Issue 3
Volume 5, Issue 1-2
Volume 4, Issue 4
Volume 4, Issue 3
Volume 4, Issue 2
Volume 4, Issue 1
Volume 3, Issue 3-4
Volume 3, Issue 2
Volume 3, Issue 1
Volume 2, Issue 4
Volume 2, Issue 3
Volume 2, Issue 2
Volume 2, Issue 1
Volume 1, Issue 4
Volume 1, Issue 3
Volume 1, Issue 2
Volume 1, Issue 1
Abstract
Let
s 2 be the sum-of-digits
function in base
2 ,
which returns the number of nonzero binary digits of a nonnegative integer
n . We
study
s 2
along arithmetic subsequences and show that — up to a shift — the set of
m -tuples
of integers that appear as an arithmetic subsequence of
s 2 has
full complexity.
Keywords
sum-of-digits function, arithmetic progression, Cusick's
conjecture
Mathematical Subject Classification 2010
Primary: 11A63, 11B25
Milestones
Received: 19 September 2019
Revised: 26 November 2019
Accepted: 10 December 2019
Published: 20 February 2020