On the Number of Times an Integer Occurs as a Binomial Coefficient
DOI10.2307/2319526zbMATH Open0276.05005OpenAlexW4237418626WikidataQ59701055 ScholiaQ59701055MaRDI QIDQ4401458FDOQ4401458
Authors: H. L. Abbott, D. Hanson, P. Erdős
Publication date: 1974
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2319526
Recommendations
Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Primes (11A41) Zeta and (L)-functions: analytic theory (11M99)
Cited In (10)
- Binomial collisions and near collisions
- An Arithmetic Triangle Arising From a One-Way Street Grid
- Multiplicities of integer arrays
- Star operations on numerical semigroups: the multiplicity 3 case.
- On \(\mathcal{I}_{<q}\)- and \(\mathcal{I}_{\le q}\)-convergence of arithmetic functions
- Title not available (Why is that?)
- On the number of ordered factorizations of natural numbers
- Improved bounds on the number of ways of expressing \(t\) as a binomial coefficient
- Repetitions of multinomial coefficients and a generalization of Singmaster's conjecture
- Equal binomial coefficients: Some elementary considerations
This page was built for publication: On the Number of Times an Integer Occurs as a Binomial Coefficient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401458)