Restricted Occupancy Theory-A Generalization of Pascal's Triangle

DOI10.2307/2308048zbMath0070.01201OpenAlexW4235697004MaRDI QIDQ3231173

John E. Freund

Publication date: 1956

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2308048

zbMATH Keywords

combinatorics

Related Items (8)

Unnamed Item ⋮ On congruences related to trinomial coefficients and harmonic numbers ⋮ s-Catalan numbers and Littlewood-Richardson polynomials ⋮ Unnamed Item ⋮ Shortest and longest length of success runs in binary sequences ⋮ A generalization of Pascal's triangle using powers of base numbers ⋮ Congruence properties for \(\mathrm{bi}^s\)nomial coefficients and like extended Ram and Kummer theorems under suitable hypothesis ⋮ Polya, Inverse Polya, and Circular Polya Distributions of Orderkforl-Overlapping Success Runs

This page was built for publication: Restricted Occupancy Theory-A Generalization of Pascal's Triangle