- Introduction
- Combinatorial Functions
- Factorial(n) : RngIntElt -> RngIntElt
- NumberOfPermutations(n, k) : RngIntElt, RngIntElt -> RngIntElt
- Binomial(n, r) : RngIntElt, RngIntElt -> RngIntElt
- Multinomial(n, [r1, ... rn]) : RngIntElt, [RngIntElt] -> RngIntElt
- Fibonacci(n) : RngIntElt -> RngIntElt
- Catalan(n) : RngIntElt -> RngIntElt
- Lucas(n) : RngIntElt -> RngIntElt
- GeneralizedFibonacciNumber(g0, g1, n) : RngIntElt, RngIntElt, RngIntElt -> RngIntElt
- StirlingFirst(n, k) : RngIntElt, RngIntElt -> RngIntElt
- StirlingSecond(n, k) : RngIntElt, RngIntElt -> RngIntElt
- Bell(n) : RngIntElt -> RngIntElt
- EulerianNumber(n, r) : RngIntElt, RngIntElt -> RngIntElt
- HarmonicNumber(n) : RngIntElt -> FldRatElt
- BernoulliNumber(n) : RngIntElt -> FldRatElt
- BernoulliApproximation(n) : RngIntElt -> FldPrElt
- BernoulliPolynomial(n) : RngIntElt -> RngUPolElt
- Subsets of a Finite Set
V2.28, 13 July 2023