OccurrencesOfInitial1Dash23
Triples 1, j, j+1 ordered as 123 (|1-23).
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001087via Permutation✓OccurrencesOfInitial1Dash23(p)Triples 1, j, j+1 ordered as 123 (|1-23).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. - FindStat titles this |12-3.
Definition
Epsil, as the implementation runs it.
on Permutation, over _x
0 if Length(_x) < 3 else Count(Filter(
Range(2, Length(_x) - 1),
Function(_x[1] < _x[j] && _x[j] < _x[j +
1], j),
))Examples
Basic #
Properties #
About
| Examples | 6 |
|---|---|
| Crosswalk | FindStat |