Abstract
Define S(r)n=∑nk=0(nk)r(r=1,2,...). An elementary method is given for finding a recurrence for Sn(r) with [ (r+3) 2] terms. This confirms an 1895 conjecture of Franel.
| Original language | English |
|---|---|
| Pages (from-to) | 77-83 |
| Number of pages | 7 |
| Journal | Journal of Combinatorial Theory, Series A |
| Volume | 52 |
| Issue number | 1 |
| DOIs | |
| State | Published - Sep 1989 |
Fingerprint
Dive into the research topics of 'Recurrences for sums of powers of binomial coefficients'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver