Spec

Fragmentos de código

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

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

$ch = curl_init("https://api.oanor.com/sequences-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/sequences-api/v1/meta",
    headers={"x-oanor-key": "oanor_test_..."}
)

Respuesta de ejemplo

Una respuesta real de este endpoint, capturada en la última comprobación de estado.

{
    "data": {
        "name": "Number Sequences API",
        "notes": "Terms beyond 2^53 are returned as decimal strings to stay exact. Membership uses closed forms for primes, squares, cubes, triangular, pentagonal and Fibonacci; other sequences are searched up to a large cap. Nothing is stored.",
        "version": "v1",
        "endpoints": [
            {
                "path": "/v1/generate",
                "params": {
                    "base": "powers base",
                    "step": "arithmetic step",
                    "count": "how many terms (default 10, max 1000)",
                    "ratio": "geometric ratio",
                    "start": "arithmetic/geometric start",
                    "sequence": "fibonacci, lucas, primes, triangular, square, cube, factorial, catalan, pentagonal, tetrahedral, arithmetic, geometric, powers"
                },
                "returns": "the sequence terms"
            },
            {
                "path": "/v1/contains",
                "params": {
                    "value": "the integer to test",
                    "sequence": "the sequence name"
                },
                "returns": "whether the number is in the sequence (and its index when known)"
            },
            {
                "path": "/v1/meta",
                "params": [],
                "returns": "this document"
            }
        ],
        "description": "Generate famous integer sequences and test membership, with exact big-integer maths. The generate endpoint returns the first N terms of a sequence — fibonacci, lucas, primes, triangular, square, cube, factorial, catalan, pentagonal, tetrahedral, plus parameterised arithmetic (start, step), geometric (start, ratio) and powers (base). The contains endpoint tells you whether a given number belongs to a sequence (is 233 a Fibonacci number? is 21 triangular? is 97 prime?), using closed-form tests where they exist. Large terms are returned exactly as strings so nothing overflows. Pure local, no key."
    },
    "meta": {
        "timestamp": "2026-06-03T09:25:02.833Z",
        "request_id": "75089189-e1f2-4ed7-a6d5-270599e518e0"
    },
    "status": "ok",
    "message": "Meta",
    "success": true
}