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