OneBoxPatterns
Positions i with a neighbouring entry, left or right, differing from p(i) by exactly 1.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000064via Permutation✓OneBoxPatterns(p)Positions i with a neighbouring entry, left or right, differing from p(i) by exactly 1.Typed signatures
| Type | Package | Applies |
|---|---|---|
(permutation) -> number | combinatorics | always |
Details
- Defined over
Permutationas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
Permutationand nothing else — it reads values against their positions, or walks the orbits, so it needs the bijection. Applying it to a bare list is a type error, not a wrong answer.
Definition
Epsil, as the implementation runs it.
on Permutation, over _x
0 if Length(_x) < 2 else Count(Filter(Range(1, Length(_x)), Function(
(Abs(_x[i] -
_x[i -
1]) ==
1 if i > 1 else False) ||
(Abs(_x[i] -
_x[i +
1]) ==
1 if i <
Length(_x) else False),
i,
)))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |