Some combinatorics of factorial base representations
From MaRDI portal
Recommendations
Cites work
- Approximating the Fibonacci sequence
- Behavior of digital sequences through exotic numeration systems
- Counting binomial coefficients divisible by a prime power
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles
- Dominance orders, generalized binomial coefficients, and Kummer's theorem
- Generalized Pascal triangle for binomial coefficients of words
- scientific article; zbMATH DE number 5289489 (Why is no real title available?)
- scientific article; zbMATH DE number 1033192 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 3231892 (Why is no real title available?)
- scientific article; zbMATH DE number 3407692 (Why is no real title available?)
- Multiplicative functions generalized binomial coefficients, and generalized Catalan numbers
- Proof Without Words: Factorial Sums
- Some combinatorics from Zeckendorf representations
- Systems of Numeration
- The power of a prime that divides a generalized binomial coefficient.
Cited in
(7)- Basic representations of \(A_{n-1}^{(1)}\) and \(A_{2n}^{(2)}\) and the combinatorics of partitions
- Dominance orders, generalized binomial coefficients, and Kummer's theorem
- On the factorial base and related counting function
- scientific article; zbMATH DE number 4034539 (Why is no real title available?)
- Real numbers in factorial representation
- Visual Triangular Number Identities from Positional Number Systems
- On a sequence related to the factoradic representation of an integer
This page was built for publication: Some combinatorics of factorial base representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5109542)