Counting non-standard binary representations
Journal of integer sequences, Tome 19 (2016) no. 3
Let $\mathcal{A}$ be a finite subset of $\mathbb{N} $ including 0 and let $f_\mathcal{A}(n)$ be the number of ways to write $n=\sum_{i=0}^{\infty}\epsilon_i2^i$, where $\epsilon_i\in\mathcal{A}$. We consider asymptotics of the summatory function $s_\mathcal{A}(r,m)$ of $f_\mathcal{A}(n)$ from $m2^{r}$ to $m2^{r+1}-1$, and show that $s_{\mathcal{A}}(r,m)\sim c(\mathcal{A},m)\left\vert\mathcal{A}\right\vert^r$ for some nonzero $c(\mathcal{A},m)\in\mathbb{Q} $.
Classification :
11A63
Keywords: digital representation, non-standard binary representation, summatory function
Keywords: digital representation, non-standard binary representation, summatory function
@article{JIS_2016__19_3_a0,
author = {Anders, Katie},
title = {Counting non-standard binary representations},
journal = {Journal of integer sequences},
year = {2016},
volume = {19},
number = {3},
zbl = {1415.11020},
language = {en},
url = {http://geodesic.mathdoc.fr/item/JIS_2016__19_3_a0/}
}
Anders, Katie. Counting non-standard binary representations. Journal of integer sequences, Tome 19 (2016) no. 3. http://geodesic.mathdoc.fr/item/JIS_2016__19_3_a0/