searching the database
Your data matches 67 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000654
(load all 45 compositions to match this statistic)
(load all 45 compositions to match this statistic)
St000654: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => 2
[2,1] => 1
[1,2,3] => 3
[1,3,2] => 2
[2,1,3] => 1
[2,3,1] => 2
[3,1,2] => 1
[3,2,1] => 1
[1,2,3,4] => 4
[1,2,4,3] => 3
[1,3,2,4] => 2
[1,3,4,2] => 3
[1,4,2,3] => 2
[1,4,3,2] => 2
[2,1,3,4] => 1
[2,1,4,3] => 1
[2,3,1,4] => 2
[2,3,4,1] => 3
[2,4,1,3] => 2
[2,4,3,1] => 2
[3,1,2,4] => 1
[3,1,4,2] => 1
[3,2,1,4] => 1
[3,2,4,1] => 1
[3,4,1,2] => 2
[3,4,2,1] => 2
[4,1,2,3] => 1
[4,1,3,2] => 1
[4,2,1,3] => 1
[4,2,3,1] => 1
[4,3,1,2] => 1
[4,3,2,1] => 1
[1,2,3,4,5] => 5
[1,2,3,5,4] => 4
[1,2,4,3,5] => 3
[1,2,4,5,3] => 4
[1,2,5,3,4] => 3
[1,2,5,4,3] => 3
[1,3,2,4,5] => 2
[1,3,2,5,4] => 2
[1,3,4,2,5] => 3
[1,3,4,5,2] => 4
[1,3,5,2,4] => 3
[1,3,5,4,2] => 3
[1,4,2,3,5] => 2
[1,4,2,5,3] => 2
[1,4,3,2,5] => 2
[1,4,3,5,2] => 2
[1,4,5,2,3] => 3
[1,4,5,3,2] => 3
Description
The first descent of a permutation.
For a permutation $\pi$ of $\{1,\ldots,n\}$, this is the smallest index $0 < i \leq n$ such that $\pi(i) > \pi(i+1)$ where one considers $\pi(n+1)=0$.
Matching statistic: St000326
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00109: Permutations —descent word⟶ Binary words
St000326: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000326: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => 0 => 2
[2,1] => 1 => 1
[1,2,3] => 00 => 3
[1,3,2] => 01 => 2
[2,1,3] => 10 => 1
[2,3,1] => 01 => 2
[3,1,2] => 10 => 1
[3,2,1] => 11 => 1
[1,2,3,4] => 000 => 4
[1,2,4,3] => 001 => 3
[1,3,2,4] => 010 => 2
[1,3,4,2] => 001 => 3
[1,4,2,3] => 010 => 2
[1,4,3,2] => 011 => 2
[2,1,3,4] => 100 => 1
[2,1,4,3] => 101 => 1
[2,3,1,4] => 010 => 2
[2,3,4,1] => 001 => 3
[2,4,1,3] => 010 => 2
[2,4,3,1] => 011 => 2
[3,1,2,4] => 100 => 1
[3,1,4,2] => 101 => 1
[3,2,1,4] => 110 => 1
[3,2,4,1] => 101 => 1
[3,4,1,2] => 010 => 2
[3,4,2,1] => 011 => 2
[4,1,2,3] => 100 => 1
[4,1,3,2] => 101 => 1
[4,2,1,3] => 110 => 1
[4,2,3,1] => 101 => 1
[4,3,1,2] => 110 => 1
[4,3,2,1] => 111 => 1
[1,2,3,4,5] => 0000 => 5
[1,2,3,5,4] => 0001 => 4
[1,2,4,3,5] => 0010 => 3
[1,2,4,5,3] => 0001 => 4
[1,2,5,3,4] => 0010 => 3
[1,2,5,4,3] => 0011 => 3
[1,3,2,4,5] => 0100 => 2
[1,3,2,5,4] => 0101 => 2
[1,3,4,2,5] => 0010 => 3
[1,3,4,5,2] => 0001 => 4
[1,3,5,2,4] => 0010 => 3
[1,3,5,4,2] => 0011 => 3
[1,4,2,3,5] => 0100 => 2
[1,4,2,5,3] => 0101 => 2
[1,4,3,2,5] => 0110 => 2
[1,4,3,5,2] => 0101 => 2
[1,4,5,2,3] => 0010 => 3
[1,4,5,3,2] => 0011 => 3
Description
The position of the first one in a binary word after appending a 1 at the end.
Regarding the binary word as a subset of $\{1,\dots,n,n+1\}$ that contains $n+1$, this is the minimal element of the set.
Matching statistic: St000382
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00071: Permutations —descent composition⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2] => 2
[2,1] => [1,1] => 1
[1,2,3] => [3] => 3
[1,3,2] => [2,1] => 2
[2,1,3] => [1,2] => 1
[2,3,1] => [2,1] => 2
[3,1,2] => [1,2] => 1
[3,2,1] => [1,1,1] => 1
[1,2,3,4] => [4] => 4
[1,2,4,3] => [3,1] => 3
[1,3,2,4] => [2,2] => 2
[1,3,4,2] => [3,1] => 3
[1,4,2,3] => [2,2] => 2
[1,4,3,2] => [2,1,1] => 2
[2,1,3,4] => [1,3] => 1
[2,1,4,3] => [1,2,1] => 1
[2,3,1,4] => [2,2] => 2
[2,3,4,1] => [3,1] => 3
[2,4,1,3] => [2,2] => 2
[2,4,3,1] => [2,1,1] => 2
[3,1,2,4] => [1,3] => 1
[3,1,4,2] => [1,2,1] => 1
[3,2,1,4] => [1,1,2] => 1
[3,2,4,1] => [1,2,1] => 1
[3,4,1,2] => [2,2] => 2
[3,4,2,1] => [2,1,1] => 2
[4,1,2,3] => [1,3] => 1
[4,1,3,2] => [1,2,1] => 1
[4,2,1,3] => [1,1,2] => 1
[4,2,3,1] => [1,2,1] => 1
[4,3,1,2] => [1,1,2] => 1
[4,3,2,1] => [1,1,1,1] => 1
[1,2,3,4,5] => [5] => 5
[1,2,3,5,4] => [4,1] => 4
[1,2,4,3,5] => [3,2] => 3
[1,2,4,5,3] => [4,1] => 4
[1,2,5,3,4] => [3,2] => 3
[1,2,5,4,3] => [3,1,1] => 3
[1,3,2,4,5] => [2,3] => 2
[1,3,2,5,4] => [2,2,1] => 2
[1,3,4,2,5] => [3,2] => 3
[1,3,4,5,2] => [4,1] => 4
[1,3,5,2,4] => [3,2] => 3
[1,3,5,4,2] => [3,1,1] => 3
[1,4,2,3,5] => [2,3] => 2
[1,4,2,5,3] => [2,2,1] => 2
[1,4,3,2,5] => [2,1,2] => 2
[1,4,3,5,2] => [2,2,1] => 2
[1,4,5,2,3] => [3,2] => 3
[1,4,5,3,2] => [3,1,1] => 3
Description
The first part of an integer composition.
Matching statistic: St000025
(load all 14 compositions to match this statistic)
(load all 14 compositions to match this statistic)
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St000025: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St000025: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [.,[.,.]]
=> [1,1,0,0]
=> 2
[2,1] => [[.,.],.]
=> [1,0,1,0]
=> 1
[1,2,3] => [.,[.,[.,.]]]
=> [1,1,1,0,0,0]
=> 3
[1,3,2] => [.,[[.,.],.]]
=> [1,1,0,1,0,0]
=> 2
[2,1,3] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1
[2,3,1] => [[.,[.,.]],.]
=> [1,1,0,0,1,0]
=> 2
[3,1,2] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1
[3,2,1] => [[[.,.],.],.]
=> [1,0,1,0,1,0]
=> 1
[1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,1,1,0,1,0,0,0]
=> 3
[1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,1,1,0,0,1,0,0]
=> 3
[1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,4,3,2] => [.,[[[.,.],.],.]]
=> [1,1,0,1,0,1,0,0]
=> 2
[2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1
[2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 1
[2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,1,0,0,0,1,0]
=> 3
[2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[2,4,3,1] => [[.,[[.,.],.]],.]
=> [1,1,0,1,0,0,1,0]
=> 2
[3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1
[3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 1
[3,2,1,4] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 1
[3,2,4,1] => [[[.,.],[.,.]],.]
=> [1,0,1,1,0,0,1,0]
=> 1
[3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[3,4,2,1] => [[[.,[.,.]],.],.]
=> [1,1,0,0,1,0,1,0]
=> 2
[4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1
[4,1,3,2] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 1
[4,2,1,3] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 1
[4,2,3,1] => [[[.,.],[.,.]],.]
=> [1,0,1,1,0,0,1,0]
=> 1
[4,3,1,2] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 1
[4,3,2,1] => [[[[.,.],.],.],.]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4
[1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 3
[1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> [1,1,1,1,0,0,1,0,0,0]
=> 4
[1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 3
[1,2,5,4,3] => [.,[.,[[[.,.],.],.]]]
=> [1,1,1,0,1,0,1,0,0,0]
=> 3
[1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,1,1,1,0,0,0,1,0,0]
=> 4
[1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[1,3,5,4,2] => [.,[[.,[[.,.],.]],.]]
=> [1,1,1,0,1,0,0,1,0,0]
=> 3
[1,4,2,3,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,4,2,5,3] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,4,3,2,5] => [.,[[[.,.],.],[.,.]]]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[1,4,3,5,2] => [.,[[[.,.],[.,.]],.]]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[1,4,5,2,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[1,4,5,3,2] => [.,[[[.,[.,.]],.],.]]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3
Description
The number of initial rises of a Dyck path.
In other words, this is the height of the first peak of $D$.
Matching statistic: St000026
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000026: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000026: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2] => [1,1,0,0]
=> 2
[2,1] => [1,1] => [1,0,1,0]
=> 1
[1,2,3] => [3] => [1,1,1,0,0,0]
=> 3
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> 2
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> 1
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> 2
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> 1
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> 1
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> 4
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> 3
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> 3
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 3
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 1
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 4
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 4
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 4
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,4,5,3,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
Description
The position of the first return of a Dyck path.
Matching statistic: St000383
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00173: Integer compositions —rotate front to back⟶ Integer compositions
St000383: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00173: Integer compositions —rotate front to back⟶ Integer compositions
St000383: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2] => [2] => 2
[2,1] => [1,1] => [1,1] => 1
[1,2,3] => [3] => [3] => 3
[1,3,2] => [2,1] => [1,2] => 2
[2,1,3] => [1,2] => [2,1] => 1
[2,3,1] => [2,1] => [1,2] => 2
[3,1,2] => [1,2] => [2,1] => 1
[3,2,1] => [1,1,1] => [1,1,1] => 1
[1,2,3,4] => [4] => [4] => 4
[1,2,4,3] => [3,1] => [1,3] => 3
[1,3,2,4] => [2,2] => [2,2] => 2
[1,3,4,2] => [3,1] => [1,3] => 3
[1,4,2,3] => [2,2] => [2,2] => 2
[1,4,3,2] => [2,1,1] => [1,1,2] => 2
[2,1,3,4] => [1,3] => [3,1] => 1
[2,1,4,3] => [1,2,1] => [2,1,1] => 1
[2,3,1,4] => [2,2] => [2,2] => 2
[2,3,4,1] => [3,1] => [1,3] => 3
[2,4,1,3] => [2,2] => [2,2] => 2
[2,4,3,1] => [2,1,1] => [1,1,2] => 2
[3,1,2,4] => [1,3] => [3,1] => 1
[3,1,4,2] => [1,2,1] => [2,1,1] => 1
[3,2,1,4] => [1,1,2] => [1,2,1] => 1
[3,2,4,1] => [1,2,1] => [2,1,1] => 1
[3,4,1,2] => [2,2] => [2,2] => 2
[3,4,2,1] => [2,1,1] => [1,1,2] => 2
[4,1,2,3] => [1,3] => [3,1] => 1
[4,1,3,2] => [1,2,1] => [2,1,1] => 1
[4,2,1,3] => [1,1,2] => [1,2,1] => 1
[4,2,3,1] => [1,2,1] => [2,1,1] => 1
[4,3,1,2] => [1,1,2] => [1,2,1] => 1
[4,3,2,1] => [1,1,1,1] => [1,1,1,1] => 1
[1,2,3,4,5] => [5] => [5] => 5
[1,2,3,5,4] => [4,1] => [1,4] => 4
[1,2,4,3,5] => [3,2] => [2,3] => 3
[1,2,4,5,3] => [4,1] => [1,4] => 4
[1,2,5,3,4] => [3,2] => [2,3] => 3
[1,2,5,4,3] => [3,1,1] => [1,1,3] => 3
[1,3,2,4,5] => [2,3] => [3,2] => 2
[1,3,2,5,4] => [2,2,1] => [2,1,2] => 2
[1,3,4,2,5] => [3,2] => [2,3] => 3
[1,3,4,5,2] => [4,1] => [1,4] => 4
[1,3,5,2,4] => [3,2] => [2,3] => 3
[1,3,5,4,2] => [3,1,1] => [1,1,3] => 3
[1,4,2,3,5] => [2,3] => [3,2] => 2
[1,4,2,5,3] => [2,2,1] => [2,1,2] => 2
[1,4,3,2,5] => [2,1,2] => [1,2,2] => 2
[1,4,3,5,2] => [2,2,1] => [2,1,2] => 2
[1,4,5,2,3] => [3,2] => [2,3] => 3
[1,4,5,3,2] => [3,1,1] => [1,1,3] => 3
Description
The last part of an integer composition.
Matching statistic: St000678
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00028: Dyck paths —reverse⟶ Dyck paths
St000678: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00028: Dyck paths —reverse⟶ Dyck paths
St000678: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [1,0,1,0]
=> [1,0,1,0]
=> 2
[2,1] => [1,1,0,0]
=> [1,1,0,0]
=> 1
[1,2,3] => [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 3
[1,3,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
[2,1,3] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[2,3,1] => [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> 2
[3,1,2] => [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 1
[3,2,1] => [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 1
[1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 4
[1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 3
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 4
[1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 3
[1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 4
[1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3
[1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3
[1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3
[1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 4
[1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3
[1,3,5,4,2] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3
[1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2
[1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,4,3,5,2] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2
[1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3
[1,4,5,3,2] => [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3
Description
The number of up steps after the last double rise of a Dyck path.
Matching statistic: St000745
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00069: Permutations —complement⟶ Permutations
Mp00070: Permutations —Robinson-Schensted recording tableau⟶ Standard tableaux
St000745: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00070: Permutations —Robinson-Schensted recording tableau⟶ Standard tableaux
St000745: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => [[1],[2]]
=> 2
[2,1] => [1,2] => [[1,2]]
=> 1
[1,2,3] => [3,2,1] => [[1],[2],[3]]
=> 3
[1,3,2] => [3,1,2] => [[1,3],[2]]
=> 2
[2,1,3] => [2,3,1] => [[1,2],[3]]
=> 1
[2,3,1] => [2,1,3] => [[1,3],[2]]
=> 2
[3,1,2] => [1,3,2] => [[1,2],[3]]
=> 1
[3,2,1] => [1,2,3] => [[1,2,3]]
=> 1
[1,2,3,4] => [4,3,2,1] => [[1],[2],[3],[4]]
=> 4
[1,2,4,3] => [4,3,1,2] => [[1,4],[2],[3]]
=> 3
[1,3,2,4] => [4,2,3,1] => [[1,3],[2],[4]]
=> 2
[1,3,4,2] => [4,2,1,3] => [[1,4],[2],[3]]
=> 3
[1,4,2,3] => [4,1,3,2] => [[1,3],[2],[4]]
=> 2
[1,4,3,2] => [4,1,2,3] => [[1,3,4],[2]]
=> 2
[2,1,3,4] => [3,4,2,1] => [[1,2],[3],[4]]
=> 1
[2,1,4,3] => [3,4,1,2] => [[1,2],[3,4]]
=> 1
[2,3,1,4] => [3,2,4,1] => [[1,3],[2],[4]]
=> 2
[2,3,4,1] => [3,2,1,4] => [[1,4],[2],[3]]
=> 3
[2,4,1,3] => [3,1,4,2] => [[1,3],[2,4]]
=> 2
[2,4,3,1] => [3,1,2,4] => [[1,3,4],[2]]
=> 2
[3,1,2,4] => [2,4,3,1] => [[1,2],[3],[4]]
=> 1
[3,1,4,2] => [2,4,1,3] => [[1,2],[3,4]]
=> 1
[3,2,1,4] => [2,3,4,1] => [[1,2,3],[4]]
=> 1
[3,2,4,1] => [2,3,1,4] => [[1,2,4],[3]]
=> 1
[3,4,1,2] => [2,1,4,3] => [[1,3],[2,4]]
=> 2
[3,4,2,1] => [2,1,3,4] => [[1,3,4],[2]]
=> 2
[4,1,2,3] => [1,4,3,2] => [[1,2],[3],[4]]
=> 1
[4,1,3,2] => [1,4,2,3] => [[1,2,4],[3]]
=> 1
[4,2,1,3] => [1,3,4,2] => [[1,2,3],[4]]
=> 1
[4,2,3,1] => [1,3,2,4] => [[1,2,4],[3]]
=> 1
[4,3,1,2] => [1,2,4,3] => [[1,2,3],[4]]
=> 1
[4,3,2,1] => [1,2,3,4] => [[1,2,3,4]]
=> 1
[1,2,3,4,5] => [5,4,3,2,1] => [[1],[2],[3],[4],[5]]
=> 5
[1,2,3,5,4] => [5,4,3,1,2] => [[1,5],[2],[3],[4]]
=> 4
[1,2,4,3,5] => [5,4,2,3,1] => [[1,4],[2],[3],[5]]
=> 3
[1,2,4,5,3] => [5,4,2,1,3] => [[1,5],[2],[3],[4]]
=> 4
[1,2,5,3,4] => [5,4,1,3,2] => [[1,4],[2],[3],[5]]
=> 3
[1,2,5,4,3] => [5,4,1,2,3] => [[1,4,5],[2],[3]]
=> 3
[1,3,2,4,5] => [5,3,4,2,1] => [[1,3],[2],[4],[5]]
=> 2
[1,3,2,5,4] => [5,3,4,1,2] => [[1,3],[2,5],[4]]
=> 2
[1,3,4,2,5] => [5,3,2,4,1] => [[1,4],[2],[3],[5]]
=> 3
[1,3,4,5,2] => [5,3,2,1,4] => [[1,5],[2],[3],[4]]
=> 4
[1,3,5,2,4] => [5,3,1,4,2] => [[1,4],[2,5],[3]]
=> 3
[1,3,5,4,2] => [5,3,1,2,4] => [[1,4,5],[2],[3]]
=> 3
[1,4,2,3,5] => [5,2,4,3,1] => [[1,3],[2],[4],[5]]
=> 2
[1,4,2,5,3] => [5,2,4,1,3] => [[1,3],[2,5],[4]]
=> 2
[1,4,3,2,5] => [5,2,3,4,1] => [[1,3,4],[2],[5]]
=> 2
[1,4,3,5,2] => [5,2,3,1,4] => [[1,3,5],[2],[4]]
=> 2
[1,4,5,2,3] => [5,2,1,4,3] => [[1,4],[2,5],[3]]
=> 3
[1,4,5,3,2] => [5,2,1,3,4] => [[1,4,5],[2],[3]]
=> 3
Description
The index of the last row whose first entry is the row number in a standard Young tableau.
Matching statistic: St000297
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00069: Permutations —complement⟶ Permutations
Mp00109: Permutations —descent word⟶ Binary words
St000297: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00109: Permutations —descent word⟶ Binary words
St000297: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => 1 => 1 = 2 - 1
[2,1] => [1,2] => 0 => 0 = 1 - 1
[1,2,3] => [3,2,1] => 11 => 2 = 3 - 1
[1,3,2] => [3,1,2] => 10 => 1 = 2 - 1
[2,1,3] => [2,3,1] => 01 => 0 = 1 - 1
[2,3,1] => [2,1,3] => 10 => 1 = 2 - 1
[3,1,2] => [1,3,2] => 01 => 0 = 1 - 1
[3,2,1] => [1,2,3] => 00 => 0 = 1 - 1
[1,2,3,4] => [4,3,2,1] => 111 => 3 = 4 - 1
[1,2,4,3] => [4,3,1,2] => 110 => 2 = 3 - 1
[1,3,2,4] => [4,2,3,1] => 101 => 1 = 2 - 1
[1,3,4,2] => [4,2,1,3] => 110 => 2 = 3 - 1
[1,4,2,3] => [4,1,3,2] => 101 => 1 = 2 - 1
[1,4,3,2] => [4,1,2,3] => 100 => 1 = 2 - 1
[2,1,3,4] => [3,4,2,1] => 011 => 0 = 1 - 1
[2,1,4,3] => [3,4,1,2] => 010 => 0 = 1 - 1
[2,3,1,4] => [3,2,4,1] => 101 => 1 = 2 - 1
[2,3,4,1] => [3,2,1,4] => 110 => 2 = 3 - 1
[2,4,1,3] => [3,1,4,2] => 101 => 1 = 2 - 1
[2,4,3,1] => [3,1,2,4] => 100 => 1 = 2 - 1
[3,1,2,4] => [2,4,3,1] => 011 => 0 = 1 - 1
[3,1,4,2] => [2,4,1,3] => 010 => 0 = 1 - 1
[3,2,1,4] => [2,3,4,1] => 001 => 0 = 1 - 1
[3,2,4,1] => [2,3,1,4] => 010 => 0 = 1 - 1
[3,4,1,2] => [2,1,4,3] => 101 => 1 = 2 - 1
[3,4,2,1] => [2,1,3,4] => 100 => 1 = 2 - 1
[4,1,2,3] => [1,4,3,2] => 011 => 0 = 1 - 1
[4,1,3,2] => [1,4,2,3] => 010 => 0 = 1 - 1
[4,2,1,3] => [1,3,4,2] => 001 => 0 = 1 - 1
[4,2,3,1] => [1,3,2,4] => 010 => 0 = 1 - 1
[4,3,1,2] => [1,2,4,3] => 001 => 0 = 1 - 1
[4,3,2,1] => [1,2,3,4] => 000 => 0 = 1 - 1
[1,2,3,4,5] => [5,4,3,2,1] => 1111 => 4 = 5 - 1
[1,2,3,5,4] => [5,4,3,1,2] => 1110 => 3 = 4 - 1
[1,2,4,3,5] => [5,4,2,3,1] => 1101 => 2 = 3 - 1
[1,2,4,5,3] => [5,4,2,1,3] => 1110 => 3 = 4 - 1
[1,2,5,3,4] => [5,4,1,3,2] => 1101 => 2 = 3 - 1
[1,2,5,4,3] => [5,4,1,2,3] => 1100 => 2 = 3 - 1
[1,3,2,4,5] => [5,3,4,2,1] => 1011 => 1 = 2 - 1
[1,3,2,5,4] => [5,3,4,1,2] => 1010 => 1 = 2 - 1
[1,3,4,2,5] => [5,3,2,4,1] => 1101 => 2 = 3 - 1
[1,3,4,5,2] => [5,3,2,1,4] => 1110 => 3 = 4 - 1
[1,3,5,2,4] => [5,3,1,4,2] => 1101 => 2 = 3 - 1
[1,3,5,4,2] => [5,3,1,2,4] => 1100 => 2 = 3 - 1
[1,4,2,3,5] => [5,2,4,3,1] => 1011 => 1 = 2 - 1
[1,4,2,5,3] => [5,2,4,1,3] => 1010 => 1 = 2 - 1
[1,4,3,2,5] => [5,2,3,4,1] => 1001 => 1 = 2 - 1
[1,4,3,5,2] => [5,2,3,1,4] => 1010 => 1 = 2 - 1
[1,4,5,2,3] => [5,2,1,4,3] => 1101 => 2 = 3 - 1
[1,4,5,3,2] => [5,2,1,3,4] => 1100 => 2 = 3 - 1
Description
The number of leading ones in a binary word.
Matching statistic: St000439
(load all 14 compositions to match this statistic)
(load all 14 compositions to match this statistic)
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St000439: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St000439: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [.,[.,.]]
=> [1,1,0,0]
=> 3 = 2 + 1
[2,1] => [[.,.],.]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,2,3] => [.,[.,[.,.]]]
=> [1,1,1,0,0,0]
=> 4 = 3 + 1
[1,3,2] => [.,[[.,.],.]]
=> [1,1,0,1,0,0]
=> 3 = 2 + 1
[2,1,3] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[2,3,1] => [[.,[.,.]],.]
=> [1,1,0,0,1,0]
=> 3 = 2 + 1
[3,1,2] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[3,2,1] => [[[.,.],.],.]
=> [1,0,1,0,1,0]
=> 2 = 1 + 1
[1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,1,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,4,3,2] => [.,[[[.,.],.],.]]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,1,0,0,0,1,0]
=> 4 = 3 + 1
[2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[2,4,3,1] => [[.,[[.,.],.]],.]
=> [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[3,2,1,4] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[3,2,4,1] => [[[.,.],[.,.]],.]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[3,4,2,1] => [[[.,[.,.]],.],.]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[4,1,3,2] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[4,2,1,3] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[4,2,3,1] => [[[.,.],[.,.]],.]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[4,3,1,2] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[4,3,2,1] => [[[[.,.],.],.],.]
=> [1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [1,1,1,1,0,1,0,0,0,0]
=> 5 = 4 + 1
[1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> [1,1,1,1,0,0,1,0,0,0]
=> 5 = 4 + 1
[1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,2,5,4,3] => [.,[.,[[[.,.],.],.]]]
=> [1,1,1,0,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 4 = 3 + 1
[1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,1,1,1,0,0,0,1,0,0]
=> 5 = 4 + 1
[1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 4 = 3 + 1
[1,3,5,4,2] => [.,[[.,[[.,.],.]],.]]
=> [1,1,1,0,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,4,2,3,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,4,2,5,3] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,4,3,2,5] => [.,[[[.,.],.],[.,.]]]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,4,3,5,2] => [.,[[[.,.],[.,.]],.]]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,4,5,2,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 4 = 3 + 1
[1,4,5,3,2] => [.,[[[.,[.,.]],.],.]]
=> [1,1,1,0,0,1,0,1,0,0]
=> 4 = 3 + 1
Description
The position of the first down step of a Dyck path.
The following 57 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000011The number of touch points (or returns) of a Dyck path. St000068The number of minimal elements in a poset. St000273The domination number of a graph. St000504The cardinality of the first block of a set partition. St000505The biggest entry in the block containing the 1. St000544The cop number of a graph. St000823The number of unsplittable factors of the set partition. St000916The packing number of a graph. St000971The smallest closer of a set partition. St001050The number of terminal closers of a set partition. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001829The common independence number of a graph. St000363The number of minimal vertex covers of a graph. St001498The normalised height of a Nakayama algebra with magnitude 1. St001316The domatic number of a graph. St000069The number of maximal elements of a poset. St000759The smallest missing part in an integer partition. St000740The last entry of a permutation. St000617The number of global maxima of a Dyck path. St000989The number of final rises of a permutation. St000054The first entry of the permutation. St000546The number of global descents of a permutation. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000738The first entry in the last row of a standard tableau. St000007The number of saliances of the permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St000990The first ascent of a permutation. St000542The number of left-to-right-minima of a permutation. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000061The number of nodes on the left branch of a binary tree. St000084The number of subtrees. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St000314The number of left-to-right-maxima of a permutation. St000335The difference of lower and upper interactions. St000501The size of the first part in the decomposition of a permutation. St000838The number of terminal right-hand endpoints when the vertices are written in order. St000991The number of right-to-left minima of a permutation. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St000051The size of the left subtree of a binary tree. St000133The "bounce" of a permutation. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St000260The radius of a connected graph. St000259The diameter of a connected graph. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000338The number of pixed points of a permutation. St001904The length of the initial strictly increasing segment of a parking function. St001937The size of the center of a parking function.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!