Skip to content
HALOWERK

Datenvertragswerk

boustrophedon sequence prefix

For one signed integer sequence prefix a0,.,aL-1 with L in 0..6 and each entry -1, 0 or 1, reconstructs the entire boustrophedon transform prefix b0,.,bL-1. Exact convention: T[n,0]=a_n; T[n,k]=T[n,k-1]+T[n-1,n-k] for 1<=k<=n; b_n=T[n,n]. Returns the transformed values in original order; an empty prefix has an empty transform. For [1,0,0,0] the output is [1,1,1,2]; for six ones it is [1,2,4,9,24,77]. Ordinary same-index cumulative sums are not used.

POST https://datenvertrag.halowerk.com/v1/boustrophedon-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 โ†’