Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001468
(load all 26 compositions to match this statistic)
Mapping
St001468: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => 1
[1,2] => 1
[2,1] => 3
[1,2,3] => 1
[1,3,2] => 1
[2,1,3] => 3
[2,3,1] => 4
[3,1,2] => 4
[3,2,1] => 2
[1,2,3,4] => 1
[1,2,4,3] => 1
[1,3,2,4] => 1
[1,3,4,2] => 1
[1,4,2,3] => 1
[1,4,3,2] => 1
[2,1,3,4] => 3
[2,1,4,3] => 5
[2,3,1,4] => 4
[2,3,4,1] => 5
[2,4,1,3] => 5
[2,4,3,1] => 3
[3,1,2,4] => 4
[3,1,4,2] => 5
[3,2,1,4] => 2
[3,2,4,1] => 2
[3,4,1,2] => 5
[3,4,2,1] => 5
[4,1,2,3] => 5
[4,1,3,2] => 3
[4,2,1,3] => 2
[4,2,3,1] => 2
[4,3,1,2] => 5
[4,3,2,1] => 5
[1,2,3,4,5] => 1
[1,2,3,5,4] => 1
[1,2,4,3,5] => 1
[1,2,4,5,3] => 1
[1,2,5,3,4] => 1
[1,2,5,4,3] => 1
[1,3,2,4,5] => 1
[1,3,2,5,4] => 1
[1,3,4,2,5] => 1
[1,3,4,5,2] => 1
[1,3,5,2,4] => 1
[1,3,5,4,2] => 1
[1,4,2,3,5] => 1
[1,4,2,5,3] => 1
[1,4,3,2,5] => 1
[1,4,3,5,2] => 1
[1,4,5,2,3] => 1
Description
The smallest fixpoint of a permutation. A fixpoint of a permutation of length $n$ if an index $i$ such that $\pi(i) = i$, and we set $\pi(n+1) = n+1$.