This seems fairly benign, in that when k > floor((n-1)/2) the binomial coefficient is zero. You could even say that the sum is over all integer k and, again, the extra terms would all be zero. (IIRC, in the book "Concrete Mathematics" by Graham, Knuth & Patashnik the authors argue quite convincingly that writing expressions containing summations in such a way that all the sums are just over all the integers -- you might then need to introduce some explicit factors of "1 if ..., else 0" -- is usually cleanest. If it's not there it's some other thing by Knuth.)
--
g