The joint distribution of binary and ternary digits sums

We consider the sum-of-digits functions $s_2$ and $s_3$ in bases $2$ and $3$. These functions just return the minimal numbers of powers of two (resp. three) needed in order to represent a nonnegative integer as their sum. A result of the second author states that there are infinitely many \emph{collisions} of $s_2$ and $s_3$, that is, positive integers $n$ such that $$s_2(n)=s_3(n)\mathrm{.}$$ This resolved a long-standing folklore conjecture. In the present paper, we prove a strong generalization of this statement, stating that $(s_2(n),s_3(n))$ attains almost all values in ${\mathbb{N}}^2$, in the sense of asymptotic density. In particular, this yields \emph{generalized collisions}: for any pair $(a,b)$ of positive integers, the equation $$a{s}_2(n)=b{s}_3(n)$$ admits infinitely many solutions in $n$.