Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
There is no useful closed-form for this. You can write it down as
$$2^N - \binomial{N}{k+1} {}_2F_{1}(1, k+1-N, k+2; -1)$$$$2^N - \binom{N}{k+1} {}_2F_{1}(1, k+1-N, k+2; -1)$$
but that's really just a rewrite of the sum in a different form.
There is no useful closed-form for this. You can write it down as
$$2^N - \binomial{N}{k+1} {}_2F_{1}(1, k+1-N, k+2; -1)$$
but that's really just a rewrite of the sum in a different form.
There is no useful closed-form for this. You can write it down as
$$2^N - \binom{N}{k+1} {}_2F_{1}(1, k+1-N, k+2; -1)$$
but that's really just a rewrite of the sum in a different form.
There is no useful closed-form for this. You can write it down as
$$2^N - \binomial{N}{k+1} {}_2F_{1}(1, k+1-N, k+2; -1)$$
but that's really just a rewrite of the sum in a different form.
