I'm trying to find a nice asymptotic expression for the expression
$$b_n = \sum_{i=0}^{n-1} \binom{n-1}{i}(-1)^i \frac{1}{(1+i)^{1+\frac{1}{\beta}}}$$
to show that $b_n \approx An^c$ for some constants $A,c$ with $c < 1$ (this is related to a previous question I asked on the expected maximum of Weibull distributions (https://stats.stackexchange.com/questions/286224/expectation-of-maximum-of-i-i-d-weibull-random-variables#comment547532_286227))
I know from a related question (A finite sum involving the binomial coefficients and the harmonic numbers) that there is an easy formula for this sum if $\beta = -1$. When $\beta= -1$, the binomial transformation becomes $H_n$, the $n^{th}$ harmonic number and I can obtain $\sum_{i=0}^{n-1} \binom{n-1}{i}(-1)^i \frac{1}{(1+i)} = H_n = \Theta(\log n)$ .
Is there a similar asymptotic approximation to $\sum_{i=0}^{n-1} \binom{n-1}{i}(-1)^i \frac{1}{(1+i)^{s}}$ for arbitrary $s > 1$ when $n$ is large?