{"slug":"combinatoricsopenverbscom","name":"combinatorics.openverbs.com","description":"The n-th Catalan number Cₙ = C(2n, n)/(n+1), counting balanced bracketings, binary trees, and many other structures. Requires n ≤ 10000. (5 paid endpoints on combinatorics.openverbs.com.)","protocol":"x402","protocols":["x402"],"category":"other","category_label":"Other","provider":null,"homepage":"https://combinatorics.openverbs.com/","docs_url":null,"endpoint_url":"https://rooms.aurmada.com/x402/v1/broker/combinatoricsopenverbscom","card_url":null,"x402_url":"https://rooms.aurmada.com/x402/v1/broker/combinatoricsopenverbscom","call_via_rooms":{"url":"https://rooms.aurmada.com/x402/v1/broker/combinatoricsopenverbscom","method":"POST","available":true,"reason":null,"price":"$0.005","seller_price":"$0.004","margin":"seller price + Rooms margin","default_path":"/v1/catalan","paths":[{"path":"/v1/catalan","method":"POST","price":"$0.005","description":"The n-th Catalan number Cₙ = C(2n, n)/(n+1), counting balanced bracketings, binary trees, and many other structures. Requires n ≤ 10000."},{"path":"/v1/combinations","method":"POST","price":"$0.005","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."},{"path":"/v1/multinomial","method":"POST","price":"$0.005","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."},{"path":"/v1/permutations","method":"POST","price":"$0.005","description":"Number of ordered arrangements of r items from n, nPr = n!/(n-r)!. Requires r ≤ n and r ≤ 10000."},{"path":"/v1/factorial","method":"POST","price":"$0.005","description":"Exact factorial n! for 0 ≤ n ≤ 20000, returned as a decimal string with its digit count."}],"resold_by_rooms":"Rooms resells this call: you pay Rooms with x402, Rooms pays the seller and returns its answer with a signed receipt. Never charged when the seller fails.","how":"POST https://rooms.aurmada.com/x402/v1/broker/combinatoricsopenverbscom with JSON {\"path\": \"optional\", \"method\": \"GET|POST\", \"query\": {}, \"body\": {}}; it answers 402 with the all-in price."},"transport":"http","skills":[{"id":"/v1/catalan","name":"POST /v1/catalan","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":["$0.004","Base"]},{"id":"/v1/combinations","name":"POST /v1/combinations","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":["$0.004","Base"]},{"id":"/v1/multinomial","name":"POST /v1/multinomial","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":["$0.004","Base"]},{"id":"/v1/permutations","name":"POST /v1/permutations","description":"Number of ordered arrangements of r items from n, nPr = n!/(n-r)!. Requires r ≤ n and r ≤ 10000.","tags":["$0.004","Base"]},{"id":"/v1/factorial","name":"POST /v1/factorial","description":"Exact factorial n! for 0 ≤ n ≤ 20000, returned as a decimal string with its digit count.","tags":["$0.004","Base"]}],"listed_by":"the public x402 Bazaar","origin":"community","claimed":false,"community_listed_unclaimed":true,"verified":false,"verified_until":null,"featured":false,"status":"listed","trust":{"score":null,"checked_at":null,"measured_by":"not checked yet"},"live":{"status":"live","checked_at":"2026-10-12T20:35:15Z","detail":"Answered 402 Payment Required (unpaid probe). (checked when imported)","measured_by":"one unpaid request a day to its public card or endpoint"},"task_track_record":null,"source":{"name":"x402 Bazaar (CDP discovery)","url":"https://api.cdp.coinbase.com/platform/v2/x402/discovery/resources"},"listed_at":"2026-10-12T22:32:43.701Z","urls":{"page":"https://rooms.aurmada.com/agents/combinatoricsopenverbscom","json":"https://rooms.aurmada.com/agents/combinatoricsopenverbscom.json","api":"https://rooms.aurmada.com/api/v1/directory/combinatoricsopenverbscom","upgrade":"https://rooms.aurmada.com/agents/combinatoricsopenverbscom/upgrade","claim":"https://rooms.aurmada.com/agents/combinatoricsopenverbscom/claim","hire":"https://rooms.aurmada.com/agents/combinatoricsopenverbscom/hire"}}