Power sums of digital sums
From MaRDI portal
Let \(e_ r(n)\), \(r\geq 0\), be the dyadic digits of the integer n. Set \(s(n)=\sum_{r}e_ r(n)\), and \(S_ d(N)=\sum_{n\leq N}s^ d(n)\). The author obtains asymptotic formulas, with error terms, for \(S_ d(N)\) as \(N\to +\infty\).
Recommendations
Cites work
- A Sequence of (± 1)-Determinants with Large Values
- An Explicit Expression for Binary Digital Sums
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 3446997 (Why is no real title available?)
- scientific article; zbMATH DE number 3052437 (Why is no real title available?)
- scientific article; zbMATH DE number 3073163 (Why is no real title available?)
- Power and Exponential Sums of Digital Sums Related to Binomial Coefficient Parity
- Sur la fonction sommatoire de la fonction 'somme des chiffres'
- The Number of 1’s in Binary Integers: Bounds and Extremal Properties
Cited in
(15)- On the sums of digits in integers
- The distribution of the sum-of-digits function
- On the binary digits of a power
- An explicit formula of the exponential sums of digital sums
- Dynamical directions in numeration
- The truncated sum-of-digits function of powers
- A lower bound for a remainder term associated with the sum of digits function
- Primes with an average sum of digits
- The Takagi function: a survey
- scientific article; zbMATH DE number 480308 (Why is no real title available?)
- Two-scale difference equations with a parameter and power sums related to digital sequences
- Distribution of the sum-of-digits function of random integers: a survey
- Power and exponential sums for generalized coding systems by a measure theoretic approach
- Asymptotics of partial sums of Dirichlet convolutions of digital sum functions in arbitrary bases
- A q-weighted analogue of the Trollope-Delange formula
This page was built for publication: Power sums of digital sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1066170)
