Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001346
(load all 10 compositions to match this statistic)
Mapping
St001346: 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] => 6
[1,3,2] => 2
[2,1,3] => 3
[2,3,1] => 2
[3,1,2] => 2
[3,2,1] => 1
[1,2,3,4] => 24
[1,2,4,3] => 6
[1,3,2,4] => 8
[1,3,4,2] => 4
[1,4,2,3] => 6
[1,4,3,2] => 2
[2,1,3,4] => 12
[2,1,4,3] => 3
[2,3,1,4] => 8
[2,3,4,1] => 6
[2,4,1,3] => 3
[2,4,3,1] => 2
[3,1,2,4] => 8
[3,1,4,2] => 4
[3,2,1,4] => 4
[3,2,4,1] => 3
[3,4,1,2] => 4
[3,4,2,1] => 2
[4,1,2,3] => 6
[4,1,3,2] => 2
[4,2,1,3] => 3
[4,2,3,1] => 2
[4,3,1,2] => 2
[4,3,2,1] => 1
[1,2,3,4,5] => 120
[1,2,3,5,4] => 24
[1,2,4,3,5] => 30
[1,2,4,5,3] => 12
[1,2,5,3,4] => 24
[1,2,5,4,3] => 6
[1,3,2,4,5] => 40
[1,3,2,5,4] => 8
[1,3,4,2,5] => 20
[1,3,4,5,2] => 12
[1,3,5,2,4] => 8
[1,3,5,4,2] => 4
[1,4,2,3,5] => 30
[1,4,2,5,3] => 12
[1,4,3,2,5] => 10
[1,4,3,5,2] => 6
[1,4,5,2,3] => 12
[1,4,5,3,2] => 4
Description
The number of parking functions that give the same permutation. A '''parking function''' $(a_1,\dots,a_n)$ is a list of preferred parking spots of $n$ cars entering a one-way street. Once the cars have parked, the order of the cars gives a permutation of $\{1,\dots,n\}$. This statistic records the number of parking functions that yield the same permutation of cars.