Recurrent combinatorial sums and binomial-type theorems
From MaRDI portal
Publication:5113651
Recommendations
Cites work
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 6151523 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- A combinatorial approach to a general two-term recurrence
- A combinatorial proof for the alternating convolution of the central binomial coefficients
- Bivariate generating functions for a class of linear recurrences: general structure
- On solutions to a general combinatorial recurrence
- Recursively defined combinatorial functions: Extending Galton's board
- The Art of Proving Binomial Identities
Cited in
(8)- A combinatorial approach to a general two-term recurrence
- Recurrences for alternating sums of powers of binomial coefficients
- The combinatorialization of linear recurrences
- scientific article; zbMATH DE number 1303203 (Why is no real title available?)
- On solutions to a general combinatorial recurrence
- Combinatorial sums and implicit Riordan arrays
- Repetitions of multinomial coefficients and a generalization of Singmaster's conjecture
- On recurrences for sums of powers of binomial coefficients
This page was built for publication: Recurrent combinatorial sums and binomial-type theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113651)