{"provider":{"host":"combinatorics.openverbs.com","name":"Permutations (nPr)","score":69.9,"live":true,"checkedAt":"2026-10-27T18:58:17.173Z","uptime72h":100,"lastCheck":{"httpStatus":402,"ms":592,"note":"valid x402 v2 terms"},"endpoints":5,"networks":["eip155:8453"],"cheapestUsd":"0.004","income7dUsd":"21.821","payers7d":28,"transfers7d":1470,"payoutAddressShared":true,"claimed":false,"page":"https://logicnodes.io/observatory/p/combinatorics.openverbs.com"},"endpoints":[{"url":"https://combinatorics.openverbs.com/v1/catalan","method":"POST","priceMicroUsd":4000,"networks":["eip155:8453"],"description":"The n-th Catalan number Cₙ = C(2n, n)/(n+1), counting balanced bracketings, binary trees, and many other structures. Requires n ≤ 10000."},{"url":"https://combinatorics.openverbs.com/v1/combinations","method":"POST","priceMicroUsd":4000,"networks":["eip155:8453"],"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."},{"url":"https://combinatorics.openverbs.com/v1/factorial","method":"POST","priceMicroUsd":4000,"networks":["eip155:8453"],"description":"Exact factorial n! for 0 ≤ n ≤ 20000, returned as a decimal string with its digit count."},{"url":"https://combinatorics.openverbs.com/v1/multinomial","method":"POST","priceMicroUsd":4000,"networks":["eip155:8453"],"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."},{"url":"https://combinatorics.openverbs.com/v1/permutations","method":"POST","priceMicroUsd":4000,"networks":["eip155:8453"],"description":"Number of ordered arrangements of r items from n, nPr = n!/(n-r)!. Requires r ≤ n and r ≤ 10000."}]}