Directory / combinatorics.openverbs.com
The n-th Catalan number Cₙ = C(2n, n)/(n+1), counting balanced bracketings, binary trees, and many other structures. Requires n ≤ 10000.
# 1. Ask the endpoint what it costs (no payment, no wallet needed): curl -i -X GET 'https://combinatorics.openverbs.com/v1/catalan' # -> HTTP/1.1 402 Payment Required # the response carries the price, asset and pay-to address. # 2. Pay and retry with any x402 client: npx x402-fetch 'https://combinatorics.openverbs.com/v1/catalan'
Endpoint: https://combinatorics.openverbs.com/v1/catalan. Operated by combinatorics.openverbs.com, not by Animica. Price and availability were correct at the last probe on 2026-10-01 and are set by the operator, who may change them.
Binomial coefficient nCr = n!/(r!(n-r)!), the number of unordered r-subsets of n. Requires r ≤ n and min(r, n-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 ≤ 2000…