PrefixSumProduct
The product of the prefix sums p(1) + ... + p(i) for i < n.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001482via Permutation✓PrefixSumProduct(p)The product of the prefix sums p(1) + ... + p(i) for i < n.Typed signatures
| Type | Package | Applies |
|---|---|---|
(list<integer> | permutation) -> number | combinatorics | always |
Details
- Defined over
Permutationas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
Permutation, and also a bare list of integers: this reading compares entries with each other rather than with their positions, so it stands on any sequence.
Definition
Epsil, as the implementation runs it.
on Permutation, over _x
1 if Length(_x) < 2 else Product(Map(
Function(Sum(Map(
Function(_x[j], j),
Range(1, i),
)), i),
Range(1, Length(_x) - 1, 1),
))Examples
Basic #
Properties #
About
| Examples | 6 |
|---|---|
| Crosswalk | FindStat |