Combinations (nCr) x402 REST usage
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 USDC per call
per call
combinatorics.openverbs.com
combinatorics.openverbs.com · 5 listed services · provider site
Catalan number x402 REST usage
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 USDC per call
per call
Permutations (nPr) x402 REST usage
Number of ordered arrangements of r items from n, nPr = n!/(n-r)!. Requires r ≤ n and r ≤ 10000.
0.004 USDC per call
per call
Multinomial coefficient x402 REST usage
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 USDC per call
per call
Factorial x402 REST usage
Exact factorial n! for 0 ≤ n ≤ 20000, returned as a decimal string with its digit count.
0.004 USDC per call
per call
Provider identity is derived from the domain or repository in the source record. If two vendors share a host, they appear together here — that is a limitation of the data, not a statement about ownership.