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 combinatorial-identities
Search options not deleted
user 31765
-1
votes
Accepted
0
votes
1
answer
106
views
positive expression
Let
$$a_{n,k}=\sum_{s_i \geq 1 \atop \sum_{i=1}^{n-k} s_i \leq n} \frac{2^{n}}{(2(n-\sum_{i=1}^{n-k} s_i)+1)!\prod_{i=1}^{n-k} (2s_i)! }$$
for $0 \leq k \leq n-1$. Prove for $1 \leq k \leq n-1$ that
…
- 1