{"x402Version":2,"name":"Combinatorics","description":"Exact combinatorial counting on arbitrary-precision integers — factorials, permutations (nPr), combinations (nCr), multinomial coefficients and Catalan numbers.","version":"0.1.0","openapi":"https://combinatorics.openverbs.com/openapi.json","resources":[{"url":"https://combinatorics.openverbs.com/v1/factorial","method":"POST","description":"Exact factorial n! for 0 ≤ n ≤ 20000, returned as a decimal string with its digit count.","tags":["factorial api","compute factorial","n factorial","exact factorial","bigint factorial","factorial digit count"],"accepts":[{"scheme":"exact","network":"eip155:8453","price":"$0.004","payTo":"0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A","asset":"USDC"}]},{"url":"https://combinatorics.openverbs.com/v1/permutations","method":"POST","description":"Number of ordered arrangements of r items from n, nPr = n!/(n-r)!. Requires r ≤ n and r ≤ 10000.","tags":["permutations npr","compute permutations","ordered arrangements","npr api","permutation count","arrangements without replacement"],"accepts":[{"scheme":"exact","network":"eip155:8453","price":"$0.004","payTo":"0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A","asset":"USDC"}]},{"url":"https://combinatorics.openverbs.com/v1/combinations","method":"POST","description":"Binomial coefficient nCr = n!/(r!(n-r)!), the number of unordered r-subsets of n. Requires r ≤ n and min(r, n-r) ≤ 10000.","tags":["combinations ncr","compute combinations","binomial coefficient","ncr api","choose r from n","combination count"],"accepts":[{"scheme":"exact","network":"eip155:8453","price":"$0.004","payTo":"0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A","asset":"USDC"}]},{"url":"https://combinatorics.openverbs.com/v1/multinomial","method":"POST","description":"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.","tags":["multinomial coefficient","compute multinomial","partition items into groups","labelled group count","multinomial api","group arrangement count"],"accepts":[{"scheme":"exact","network":"eip155:8453","price":"$0.004","payTo":"0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A","asset":"USDC"}]},{"url":"https://combinatorics.openverbs.com/v1/catalan","method":"POST","description":"The n-th Catalan number Cₙ = C(2n, n)/(n+1), counting balanced bracketings, binary trees, and many other structures. Requires n ≤ 10000.","tags":["catalan number","compute catalan","balanced bracket count","binary tree count","catalan api","combinatorics sequence"],"accepts":[{"scheme":"exact","network":"eip155:8453","price":"$0.004","payTo":"0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A","asset":"USDC"}]}]}