Combinations (nCr)
combinatorics.openverbs.com
Multinomial coefficient (k1+k2+…)! / (k1! k2! …) — the number of ways to partition n = Σki items into labelled groups of the given sizes. The sum must be ≤ 20000.
- Category
- Service
- Networks
- Base
- Starting price
- $0.004
- Paid calls, 30 days
- 7
Paid endpoints
5 endpoints, sorted by usage. Prices are per request.
| Endpoint | Price | Network | Facilitator | Calls / 30d |
|---|---|---|---|---|
POST/v1/catalan The n-th Catalan number Cₙ = C(2n, n)/(n+1), counting balanced bracketings, binary trees, and many other structures. Requires n ≤ 10000. | $0.004 | Base | Coinbase CDP | 2 |
POST/v1/combinations Binomial coefficient nCr = n!/(r!(n-r)!), the number of unordered r-subsets of n. Requires r ≤ n and min(r, n-r) ≤ 10000. | $0.004 | Base | Coinbase CDP | 2 |
POST/v1/factorial Exact factorial n! for 0 ≤ n ≤ 20000, returned as a decimal string with its digit count. | $0.004 | Base | Coinbase CDP | 1 |
POST/v1/multinomial Multinomial coefficient (k1+k2+…)! / (k1! k2! …) — the number of ways to partition n = Σki items into labelled groups of the given sizes. The sum must be ≤ 20000. | $0.004 | Base | Coinbase CDP | 1 |
POST/v1/permutations Number of ordered arrangements of r items from n, nPr = n!/(n-r)!. Requires r ≤ n and r ≤ 10000. | $0.004 | Base | Coinbase CDP | 1 |
Is this your project? Suggest an edit.