For a row $n$ of Pascal's triangle, what is the expected value of the sum of every $k$th element, (Starting from $1,2,\cdots,k-1$ places), as compared to $\frac{2^n}{k}$?
I've tried representing the sums of each $k$ in terms of roots of unity, but since there's no clear evaluation of the roots of unity with ease, I haven't really gotten anywhere that way.
For 3, I found a pattern that repeats every 6 rows away, but the pattern seems to diverge as $k$ increases. Is there a clear pattern or a way to represent this in a cleaner formula?