On the minimal length of addition chains

Jean-Marie De Koninck, Nicolas Doyon, William Verreault

We denote by $\ell (n)$ the minimal length of an addition chain leading to $n$ and we define the counting function $$F(m,r):=\#\left\{n\in [2^m,2^{m+1}):\ell (n)\le m+r\right\},$$…