Restricted Occupancy Theory-A Generalization of Pascal's Triangle
From MaRDI portal
Cited in
(13)- Congruence properties for \(\mathrm{bi}^s\)nomial coefficients and like extended Ram and Kummer theorems under suitable hypothesis
- Shortest and longest length of success runs in binary sequences
- A generalization of Pascal's triangle using powers of base numbers
- Polya, Inverse Polya, and Circular Polya Distributions of Orderkforl-Overlapping Success Runs
- On congruences related to trinomial coefficients and harmonic numbers
- scientific article; zbMATH DE number 7157988 (Why is no real title available?)
- scientific article; zbMATH DE number 7674556 (Why is no real title available?)
- s-Catalan numbers and Littlewood-Richardson polynomials
- Supercongruences concerning bi\(^s\)nomial coefficients
- Congruence properties for the quadrinomial coefficients
- Orientable and negative orientable sequences
- The 2-Pascal triangle and a related Riordan array
- Generating b-nomial numbers
This page was built for publication: Restricted Occupancy Theory-A Generalization of Pascal's Triangle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3231173)