Datenvertragswerk
binomial sequence prefix
Constructs the entire forward positive binomial transform of one signed prefix a0,.,aL-1 with L in 0..7 and each entry -1, 0 or 1. The exact map is b_n = SUM for k in 0..n of binomial(n,k)*a_k, for every n in 0..L-1 in original order. An empty prefix maps to []; a0 is captured, not an implicit 1, and trailing zeros are retained. This is the forward positive sum, not the signed inverse: (-1)^(n-k) is not used.
POST https://datenvertrag.halowerk.com/v1/binomial-sequence-prefixInputs
| Field | Type | Required | Description |
|---|---|---|---|
| prefix | See schema | Yes | |
| claim | See schema | Yes |
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
}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
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.