Spec

Code-Snippets

curl "https://api.oanor.com/combinatorics-api/v1/meta" \
  -H "x-oanor-key: oanor_test_..."

await fetch("https://api.oanor.com/combinatorics-api/v1/meta", {
  headers: { "x-oanor-key": "oanor_test_..." }
});

$ch = curl_init("https://api.oanor.com/combinatorics-api/v1/meta");
curl_setopt($ch, CURLOPT_HTTPHEADER, ["x-oanor-key: oanor_test_..."]);
curl_setopt($ch, CURLOPT_RETURNTRANSFER, true);
$out = curl_exec($ch);

import requests
requests.get(
    "https://api.oanor.com/combinatorics-api/v1/meta",
    headers={"x-oanor-key": "oanor_test_..."}
)

Beispiel-Response

Echte Antwort dieses Endpoints, erfasst beim letzten Health-Check.

{
    "data": {
        "notes": "n and r are non-negative integers up to 100000. Results are exact (BigInt) and returned as a string with the digit count; a float approximation is included when it fits.",
        "service": "combinatorics-api",
        "formulae": {
            "combinations": "nCr = n!/(r!(n−r)!) ; with repetition C(n+r−1, r)",
            "permutations": "nPr = n!/(n−r)! ; with repetition n^r"
        },
        "endpoints": {
            "GET /v1/meta": "This document.",
            "GET /v1/factorial": "n! as an exact integer with its digit count.",
            "GET /v1/combinations": "nCr (binomial) unordered selections, with or without repetition.",
            "GET /v1/permutations": "nPr ordered arrangements, with or without repetition."
        },
        "description": "Combinatorics calculator: factorial, permutations and combinations with or without repetition, computed exactly with arbitrary-precision integers."
    },
    "meta": {
        "timestamp": "2026-06-05T11:30:32.244Z",
        "request_id": "f571f840-2261-4745-8ddf-20657a6966a7"
    },
    "status": "ok",
    "message": "Meta",
    "success": true
}