The sum-of-digits function on arithmetic progressions
From MaRDI portal
Publication:2299252
Abstract: Let be the sum-of-digits function in base , which returns the number of non-zero binary digits of a nonnegative integer . We study alon g 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.
Recommendations
Cites work
- Approaching Cusick's conjecture on the sum-of-digits function
- Central limit theorem for probability measures defined by sum-of-digits function in base 2
- Gowers norms for the Thue-Morse and Rudin-Shapiro sequences
- Indépendance statistique d'ensembles liés à la fonction "somme des chiffres"
- Normality of the Thue-Morse sequence along Piatetski-Shapiro sequences. II
- On a conjecture of Cusick concerning the sum of digits of \(n\) and \(n+t\)
- On arithmetic progressions of integers with a distinct sum of digits
Cited in
(13)- The Sum-of-Digits Function of Squares
- On the sum of digits functions for number systems with negative bases
- Relations among arithmetical functions, automatic sequences, and sum of digits functions induced by certain Gray codes
- On the hereditary sum of digits function to base \(q\)
- scientific article; zbMATH DE number 5688289 (Why is no real title available?)
- Approaching Cusick's conjecture on the sum-of-digits function
- On a conjecture of Cusick concerning the sum of digits of \(n\) and \(n+t\)
- The truncated sum-of-digits function of powers
- The truncated sum of digits function of polynomial sequences
- The binary digits of n+t
- Finite generating functions for the sum-of-digits sequence
- scientific article; zbMATH DE number 1829512 (Why is no real title available?)
- A remark on a summation formula related with the sum of digits
This page was built for publication: The sum-of-digits function on arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299252)