Some binomial convolution formulas
From MaRDI portal
Let \(d\), \(m\), \(n\) be positive integers. Let \(\{A(k)\}_k\), \(\{B(k)\}_k\) be two sequences of binomial coefficients. When \(d= 2,3\) and \(4\), the convolutions of Vandermonde type \(\sum_k A(m+ dk)B(n- dk)\) are called duplicate, triplicate and quadruplicate, respectively. In 1999, using the formal power series method, the author gave some binomial formulas on duplicate convolutions. In the present paper, some binomial formulas on triplicate and quadruplicate convolutions are given.
Recommendations
- Binomial convolutions and hypergeometric identities
- Multiple convolution formulae on classical combinatorial numbers
- Generalized binomial convolution of the \(m\)th powers of the consecutive integers with the general Fibonacci sequence
- scientific article; zbMATH DE number 7134756
- Partial sums of binomial convolutions.
Cited in
(13)- Binomial convolutions and determinant identities
- Further equivalent binomial sums
- Another class of nonterminating \(_3F_2\)-series with a free argument
- Seven equivalent binomial sums
- Legendre inversions and balanced hypergeometric series identities
- Annihilation coefficients, binomial expansions and q-analogs
- Multiple convolution formulas on powers of positive integers
- Triple product sums of Catalan triangle numbers
- B-binomial convolution and associated arithmetical functions and their properties
- Non-terminating3F2-series with unit argument
- Logarithms of a binomial series: extension of a series of Knuth
- scientific article; zbMATH DE number 7134756 (Why is no real title available?)
- Nonterminating 3F2-series with a free variable
This page was built for publication: Some binomial convolution formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2785024)