The n-th Catalan number Cₙ = C(2n, n)/(n+1), counting balanced bracketings, binary tree…
The n-th Catalan number Cₙ = C(2n, n)/(n+1), counting balanced bracketings, binary trees, and many other structures. Requires n ≤ 10000.
5 resources listed under combinatorics.openverbs.com.
Source: https://api.cdp.coinbase.com/platform/v2/x402/discovery/resources · last updated 2026-10-14
These 5 resources were mirrored from Coinbase's public Bazaar. Claim them all at once by submitting your own manifest — no account required, and it always overrides the mirrored copy.
Claim this providerThe n-th Catalan number Cₙ = C(2n, n)/(n+1), counting balanced bracketings, binary trees, and many other structures. Requires n ≤ 10000.
Binomial coefficient nCr = n!/(r!(n-r)!), the number of unordered r-subsets of n. Requires r ≤ n and min(r, n-r) ≤ 10000.
Number of ordered arrangements of r items from n, nPr = n!/(n-r)!. Requires r ≤ n and r ≤ 10000.
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.
Exact factorial n! for 0 ≤ n ≤ 20000, returned as a decimal string with its digit count.
All resources from this provider: /discovery/merchant (by payment address) or filter /discovery/resources.