On a combinatorial problem of Asmus Schmidt (Q1883632)

From MaRDI portal
Revision as of 22:38, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On a combinatorial problem of Asmus Schmidt
scientific article

    Statements

    On a combinatorial problem of Asmus Schmidt (English)
    0 references
    13 October 2004
    0 references
    Summary: For any integer \(r\geq 2\), define a sequence of numbers \(\{c^{(r)}_k\}_{k=0,1,\dots}\), independent of the parameter \(n\), by \[ \sum^n_{k=0}\binom nk^r\binom{n+k}{k}^r=\sum^n_{k=0}\binom nk\binom{n+k}{k}c^{(r)}_k,\quad n=0,1,2,\dots. \] We prove that all the numbers \(c^{(r)}_k\) are integers.
    0 references
    0 references

    Identifiers