Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001566
(load all 4 compositions to match this statistic)
Mapping
St001566: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => 1
[1,2] => 2
[2,1] => 2
[1,2,3] => 3
[1,3,2] => 2
[2,1,3] => 2
[2,3,1] => 2
[3,1,2] => 2
[3,2,1] => 3
[1,2,3,4] => 4
[1,2,4,3] => 3
[1,3,2,4] => 2
[1,3,4,2] => 2
[1,4,2,3] => 3
[1,4,3,2] => 3
[2,1,3,4] => 3
[2,1,4,3] => 2
[2,3,1,4] => 3
[2,3,4,1] => 3
[2,4,1,3] => 2
[2,4,3,1] => 2
[3,1,2,4] => 2
[3,1,4,2] => 2
[3,2,1,4] => 3
[3,2,4,1] => 3
[3,4,1,2] => 2
[3,4,2,1] => 3
[4,1,2,3] => 3
[4,1,3,2] => 3
[4,2,1,3] => 2
[4,2,3,1] => 2
[4,3,1,2] => 3
[4,3,2,1] => 4
[1,2,3,4,5] => 5
[1,2,3,5,4] => 4
[1,2,4,3,5] => 3
[1,2,4,5,3] => 3
[1,2,5,3,4] => 4
[1,2,5,4,3] => 3
[1,3,2,4,5] => 3
[1,3,2,5,4] => 3
[1,3,4,2,5] => 3
[1,3,4,5,2] => 3
[1,3,5,2,4] => 3
[1,3,5,4,2] => 3
[1,4,2,3,5] => 3
[1,4,2,5,3] => 3
[1,4,3,2,5] => 3
[1,4,3,5,2] => 3
[1,4,5,2,3] => 3
Description
The length of the longest arithmetic progression in a permutation. For a permutation $\pi$ of length $n$, this is the biggest $k$ such that there exist $1 \leq i_1 < \dots < i_k \leq n$ with $$\pi(i_2) - \pi(i_1) = \pi(i_3) - \pi(i_2) = \dots = \pi(i_k) - \pi(i_{k-1}).$$