Skip to content
HALOWERK

Datenvertragswerk

stirling second kind sequence prefix

Computes the complete second-kind Stirling transform of one signed integer prefix a0,.,aL-1 (L 0..6, each entry -1, 0 or 1): b_n=sum for k 0..n of S(n,k)*a_k for every n 0..L-1, where S(n,k) counts partitions of n labelled elements into k nonempty blocks and S(0,0)=1. Follows Bernstein/Sloane (arXiv math/0205301v1), with EGF identity B(x)=A(exp(x)-1). This is the forward transform, not the inverse signed first-kind or binomial transform.

POST https://datenvertrag.halowerk.com/v1/stirling-second-kind-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": 6
        },
        {
          "type": "null"
        }
      ]
    },
    "claim": {
      "anyOf": [
        {
          "type": "array",
          "items": {
            "type": "integer",
            "minimum": -1000,
            "maximum": 1000
          },
          "minItems": 0,
          "maxItems": 6
        },
        {
          "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 โ†’