Identifier
- St000133: Permutations ⟶ ℤ
Values
[1] => 0
[1,2] => 1
[2,1] => 0
[1,2,3] => 3
[1,3,2] => 2
[2,1,3] => 1
[2,3,1] => 0
[3,1,2] => 1
[3,2,1] => 0
[1,2,3,4] => 6
[1,2,4,3] => 5
[1,3,2,4] => 4
[1,3,4,2] => 3
[1,4,2,3] => 4
[1,4,3,2] => 3
[2,1,3,4] => 3
[2,1,4,3] => 2
[2,3,1,4] => 1
[2,3,4,1] => 0
[2,4,1,3] => 1
[2,4,3,1] => 0
[3,1,2,4] => 3
[3,1,4,2] => 2
[3,2,1,4] => 1
[3,2,4,1] => 0
[3,4,1,2] => 1
[3,4,2,1] => 0
[4,1,2,3] => 2
[4,1,3,2] => 2
[4,2,1,3] => 1
[4,2,3,1] => 0
[4,3,1,2] => 1
[4,3,2,1] => 0
[1,2,3,4,5] => 10
[1,2,3,5,4] => 9
[1,2,4,3,5] => 8
[1,2,4,5,3] => 7
[1,2,5,3,4] => 8
[1,2,5,4,3] => 7
[1,3,2,4,5] => 7
[1,3,2,5,4] => 6
[1,3,4,2,5] => 5
[1,3,4,5,2] => 4
[1,3,5,2,4] => 5
[1,3,5,4,2] => 4
[1,4,2,3,5] => 7
[1,4,2,5,3] => 6
[1,4,3,2,5] => 5
[1,4,3,5,2] => 4
[1,4,5,2,3] => 5
[1,4,5,3,2] => 4
[1,5,2,3,4] => 6
[1,5,2,4,3] => 6
[1,5,3,2,4] => 5
[1,5,3,4,2] => 4
[1,5,4,2,3] => 5
[1,5,4,3,2] => 4
[2,1,3,4,5] => 6
[2,1,3,5,4] => 5
[2,1,4,3,5] => 4
[2,1,4,5,3] => 3
[2,1,5,3,4] => 4
[2,1,5,4,3] => 3
[2,3,1,4,5] => 3
[2,3,1,5,4] => 2
[2,3,4,1,5] => 1
[2,3,4,5,1] => 0
[2,3,5,1,4] => 1
[2,3,5,4,1] => 0
[2,4,1,3,5] => 3
[2,4,1,5,3] => 2
[2,4,3,1,5] => 1
[2,4,3,5,1] => 0
[2,4,5,1,3] => 1
[2,4,5,3,1] => 0
[2,5,1,3,4] => 2
[2,5,1,4,3] => 2
[2,5,3,1,4] => 1
[2,5,3,4,1] => 0
[2,5,4,1,3] => 1
[2,5,4,3,1] => 0
[3,1,2,4,5] => 6
[3,1,2,5,4] => 5
[3,1,4,2,5] => 4
[3,1,4,5,2] => 3
[3,1,5,2,4] => 4
[3,1,5,4,2] => 3
[3,2,1,4,5] => 3
[3,2,1,5,4] => 2
[3,2,4,1,5] => 1
[3,2,4,5,1] => 0
[3,2,5,1,4] => 1
[3,2,5,4,1] => 0
[3,4,1,2,5] => 3
[3,4,1,5,2] => 2
[3,4,2,1,5] => 1
[3,4,2,5,1] => 0
[3,4,5,1,2] => 1
[3,4,5,2,1] => 0
[3,5,1,2,4] => 2
[3,5,1,4,2] => 2
>>> Load all 873 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 "bounce" of a permutation.
Code
def statistic(w):
n = len(w)
v = w.inverse()
bounces = [v[0]]
while bounces[-1] < n:
bounces.append(max(v[:bounces[-1] + 1]))
return sum([n - i for i in bounces])
Created
Jun 19, 2013 at 15:40 by Sam Clearman
Updated
Mar 28, 2015 at 22:46 by Martin Rubey
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!