Skip to content
HALOWERK

Datenvertragswerk

exponential bell sequence prefix

Compute the complete exponential Bell transform of a captured signed sequence a1,.,aN. The output b1,.,bN is defined by exp(sum(a_k*x^k/k!, k=1..N)) = 1 + sum(b_n*x^n/n!, n=1..N) through the captured degree N. Equivalently, b_n is the sum over all set partitions of n labelled elements of the product of a_(block size) over their blocks. For example, [1,1,1] maps to [1,2,5], and [1,0,0] maps to [1,1,1]. This is the complete exponential convention, corresponding to SageMath bell_polynomial.

POST https://datenvertrag.halowerk.com/v1/exponential-bell-sequence-prefix

Inputs

Fields of the published input schema
FieldTypeRequiredDescription
prefixSee schemaYes
claimSee schemaYes
Show full input schema
{
  "type": "object",
  "properties": {
    "prefix": {
      "anyOf": [
        {
          "type": "array",
          "items": {
            "type": "integer",
            "minimum": -1,
            "maximum": 1
          },
          "minItems": 0,
          "maxItems": 7
        },
        {
          "type": "null"
        }
      ]
    },
    "claim": {
      "anyOf": [
        {
          "type": "array",
          "items": {
            "type": "integer",
            "minimum": -1000,
            "maximum": 1000
          },
          "minItems": 0,
          "maxItems": 7
        },
        {
          "type": "null"
        }
      ]
    }
  },
  "required": [
    "prefix",
    "claim"
  ],
  "additionalProperties": false
}

Open original schema

Published input example

{
  "prefix": [],
  "claim": []
}

Result & documentation

Machine-readable documentation of this hub

Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.

More endpoints in this hub

All endpoints in this hub โ†’