On a combinatorial problem of Asmus Schmidt
| dc.creator | Zudilin, Wadim | |
| dc.date | 2003-11-12 | |
| dc.date.accessioned | 2026-07-07T05:02:50Z | |
| dc.date.available | 2026-07-07T05:02:50Z | |
| dc.description | For any integer $r\ge2$, define a sequence of numbers $\{c_k^{(r)}\}_{k=0}^\infty$, independent of the parameter $n$, by $$ \sum_{k=0}^n{\binom nk}^r{\binom{n+k}k}^r =\sum_{k=0}^n\binom nk\binom{n+k}kc_k^{(r)}, \qquad n=0,1,2,...c. $$ We prove that all the numbers $c_k^{(r)}$ are integers. | |
| dc.description | 7 pages, AmSTeX | |
| dc.identifier | https://arxiv.org/abs/math/0311195 | |
| dc.identifier | http://arxiv.org/abs/math/0311195 | |
| dc.identifier | Electron. J. Combin. 11:1 (2004), #R22, 8 pages | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/69167 | |
| dc.subject | Classical Analysis and ODEs | |
| dc.subject | Combinatorics | |
| dc.subject | 11B65, 33C20 | |
| dc.title | On a combinatorial problem of Asmus Schmidt | |
| dc.type | text |