Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with generating-functions
Search options not deleted
user 265714
A generating function is a way of encoding an infinite sequence of numbers by treating them as the coefficients of a formal power series. Tag questions involving generating functions in this.
0
votes
1
answer
160
views
Is there a closed form of $\sum_{i=1}^{n-k} {n-1-i\choose k-1}x^i$ in $x$?
I'm looking for the generating function of the sum $\sum_{i=1}^{n-k} {n-1-i\choose k-1}x^i$. One can compute this using the Euler-MacLauren formula but the remainder term is a little messy. Is there …
- 1,109