Identifier
Values
[1] => [1] => [1] => 0
[1,2] => [1,2] => [1,2] => 0
[2,1] => [1,2] => [1,2] => 0
[1,2,3] => [1,2,3] => [1,2,3] => 0
[1,3,2] => [1,3,2] => [1,3,2] => 1
[2,1,3] => [1,3,2] => [1,3,2] => 1
[2,3,1] => [1,2,3] => [1,2,3] => 0
[3,1,2] => [1,2,3] => [1,2,3] => 0
[3,2,1] => [1,2,3] => [1,2,3] => 0
[1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 1
[1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 1
[1,3,4,2] => [1,3,4,2] => [1,3,4,2] => 1
[1,4,2,3] => [1,4,2,3] => [1,4,2,3] => 2
[1,4,3,2] => [1,4,2,3] => [1,4,2,3] => 2
[2,1,3,4] => [1,3,4,2] => [1,3,4,2] => 1
[2,1,4,3] => [1,4,2,3] => [1,4,2,3] => 2
[2,3,1,4] => [1,4,2,3] => [1,4,2,3] => 2
[2,3,4,1] => [1,2,3,4] => [1,2,3,4] => 0
[2,4,1,3] => [1,3,2,4] => [1,3,2,4] => 1
[2,4,3,1] => [1,2,4,3] => [1,2,4,3] => 1
[3,1,2,4] => [1,2,4,3] => [1,2,4,3] => 1
[3,1,4,2] => [1,4,2,3] => [1,4,2,3] => 2
[3,2,1,4] => [1,4,2,3] => [1,4,2,3] => 2
[3,2,4,1] => [1,2,4,3] => [1,2,4,3] => 1
[3,4,1,2] => [1,2,3,4] => [1,2,3,4] => 0
[3,4,2,1] => [1,2,3,4] => [1,2,3,4] => 0
[4,1,2,3] => [1,2,3,4] => [1,2,3,4] => 0
[4,1,3,2] => [1,3,2,4] => [1,3,2,4] => 1
[4,2,1,3] => [1,3,2,4] => [1,3,2,4] => 1
[4,2,3,1] => [1,2,3,4] => [1,2,3,4] => 0
[4,3,1,2] => [1,2,3,4] => [1,2,3,4] => 0
[4,3,2,1] => [1,2,3,4] => [1,2,3,4] => 0
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
click to show known generating functions       
Description
The number of preferred parking spots in a parking function less than the index of the car.
Let $(a_1,\dots,a_n)$ be a parking function. Then this statistic returns the number of indices $1\leq i\leq n$ such that $a_i < i$.
Map
runsort
Description
The permutation obtained by sorting the increasing runs lexicographically.
Map
parking function
Description
Interpret the permutation as a parking function.