Building on this post, we conclude that the Gould's sequence A001316 is formulated as follows:
$$G(n)=\frac{2^n}{gcd(2^n,n!)}=2^{H(n)}$$
Where $H(n)$ is the Hamming weight of a number $n\in\mathbb{N}$. Therefore, it can be expressed as:
$$H(n)=\log_2\left(G(n)\right)=\log_2\left(\frac{2^n}{gcd(2^n,n!)}\right)$$
Or, alternatively, given that the amount of 2 factors in $n!$ is produced by the Legendre's formula, it can be rewritten as:
$$H(n)=\log_2\left(\frac{2^n}{\displaystyle\sum _{k=1}^{\left\lfloor \log _2(n)\right\rfloor } \left\lfloor \frac{n}{2^k}\right\rfloor}\right)$$
However, I didn't find any proof for the first formulation of $H(n)$, so I would like to know how can it be proven the equivalence between the Hamming weight of a positive integer $n$ and the base-2 logarithm of the ratio between $2^n$ and its greatest common divisor with $n!$, which is given by the Legendre's $v_2(n!)$.