Moments of combinatorial and Catalan numbers (Q982537): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Moments on Catalan numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Divided differences and generalized Taylor series / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Factors of binomial sums from the Catalan triangle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New identities in the Catalan triangle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Catalan numbers, their generalization, and their uses / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3400701 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Catalan triangle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4236280 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rational Functions Certify Combinatorial Identities / rank | |||
Normal rank |
Revision as of 23:37, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Moments of combinatorial and Catalan numbers |
scientific article |
Statements
Moments of combinatorial and Catalan numbers (English)
0 references
7 July 2010
0 references
If \(n\) is a natural number, then the \(n\)th Catalan number is defined by \[ C_n= {1\over n+1} {3n\choose n}. \] If also the natural number \(p\geq n\), define \[ B_{n,p}= {p\over n} {2n\choose n-p};\quad A_{n,p}= {2p-1\over 2n+1} {2n+1\choose n+1-p}. \] Let \(\Omega_m(n)= \sum^n_{p=1} p^m B^2_{n,p}\). The authors obtain formulas that express \(\Omega_m(n)\) in terms of Catalan numbers and polynomial sequences with integer coefficients. They also obtain formulas for the additional functions listed below: \[ \Phi_m(n)= \sum^{n+1}_{p=1} (2p- 1)^m{2n+1\choose n+1-p}^2;\quad \Psi_m(n)= \sum^{n+1}_{p=1} (2p-1)^m A^2_{n,p}. \] (There are actually separate formulas corresponding to the cases \(m\) odd, \(m\) even.)
0 references
Catalan numbers
0 references
combinatorial identities
0 references
binomial coefficients
0 references