Identifier
- St000372: Permutations ⟶ ℤ
Values
[1] => 0
[1,2] => 0
[2,1] => 0
[1,2,3] => 1
[1,3,2] => 0
[2,1,3] => 0
[2,3,1] => 0
[3,1,2] => 0
[3,2,1] => 0
[1,2,3,4] => 2
[1,2,4,3] => 1
[1,3,2,4] => 2
[1,3,4,2] => 1
[1,4,2,3] => 1
[1,4,3,2] => 0
[2,1,3,4] => 1
[2,1,4,3] => 0
[2,3,1,4] => 1
[2,3,4,1] => 1
[2,4,1,3] => 0
[2,4,3,1] => 0
[3,1,2,4] => 1
[3,1,4,2] => 0
[3,2,1,4] => 0
[3,2,4,1] => 0
[3,4,1,2] => 0
[3,4,2,1] => 0
[4,1,2,3] => 1
[4,1,3,2] => 0
[4,2,1,3] => 0
[4,2,3,1] => 0
[4,3,1,2] => 0
[4,3,2,1] => 0
[1,2,3,4,5] => 3
[1,2,3,5,4] => 2
[1,2,4,3,5] => 3
[1,2,4,5,3] => 2
[1,2,5,3,4] => 2
[1,2,5,4,3] => 1
[1,3,2,4,5] => 3
[1,3,2,5,4] => 2
[1,3,4,2,5] => 3
[1,3,4,5,2] => 2
[1,3,5,2,4] => 2
[1,3,5,4,2] => 1
[1,4,2,3,5] => 3
[1,4,2,5,3] => 2
[1,4,3,2,5] => 3
[1,4,3,5,2] => 2
[1,4,5,2,3] => 2
[1,4,5,3,2] => 1
[1,5,2,3,4] => 2
[1,5,2,4,3] => 1
[1,5,3,2,4] => 2
[1,5,3,4,2] => 1
[1,5,4,2,3] => 1
[1,5,4,3,2] => 0
[2,1,3,4,5] => 2
[2,1,3,5,4] => 1
[2,1,4,3,5] => 2
[2,1,4,5,3] => 1
[2,1,5,3,4] => 1
[2,1,5,4,3] => 0
[2,3,1,4,5] => 2
[2,3,1,5,4] => 1
[2,3,4,1,5] => 2
[2,3,4,5,1] => 2
[2,3,5,1,4] => 1
[2,3,5,4,1] => 1
[2,4,1,3,5] => 2
[2,4,1,5,3] => 1
[2,4,3,1,5] => 2
[2,4,3,5,1] => 2
[2,4,5,1,3] => 1
[2,4,5,3,1] => 1
[2,5,1,3,4] => 1
[2,5,1,4,3] => 0
[2,5,3,1,4] => 1
[2,5,3,4,1] => 1
[2,5,4,1,3] => 0
[2,5,4,3,1] => 0
[3,1,2,4,5] => 2
[3,1,2,5,4] => 1
[3,1,4,2,5] => 2
[3,1,4,5,2] => 1
[3,1,5,2,4] => 1
[3,1,5,4,2] => 0
[3,2,1,4,5] => 1
[3,2,1,5,4] => 0
[3,2,4,1,5] => 1
[3,2,4,5,1] => 1
[3,2,5,1,4] => 0
[3,2,5,4,1] => 0
[3,4,1,2,5] => 2
[3,4,1,5,2] => 1
[3,4,2,1,5] => 1
[3,4,2,5,1] => 1
[3,4,5,1,2] => 1
[3,4,5,2,1] => 1
[3,5,1,2,4] => 1
[3,5,1,4,2] => 0
>>> Load all 1201 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The number of mid points of increasing subsequences of length 3 in a permutation.
For a permutation $\pi$ of $\{1,\ldots,n\}$, this is the number of indices $j$ such that there exist indices $i,k$ with $i < j < k$ and $\pi(i) < \pi(j) < \pi(k)$.
The generating function is given by [1].
For a permutation $\pi$ of $\{1,\ldots,n\}$, this is the number of indices $j$ such that there exist indices $i,k$ with $i < j < k$ and $\pi(i) < \pi(j) < \pi(k)$.
The generating function is given by [1].
References
[1] Triangle read by rows: T(n,k) is the number of permutations of 1,2,...,n having exactly k entries that are midpoints of 321 patterns (0<=k<=n-2 for n>=2; k=0 for n=1). OEIS:A145879
Code
def statistic(pi):
return len(set( pattern[1] for pattern in pi.pattern_positions([1,2,3]) ))
Created
Feb 02, 2016 at 21:36 by Christian Stump
Updated
May 10, 2019 at 17:29 by Henning Ulfarsson
searching the database
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!