Identifier
- St001346: Permutations ⟶ ℤ
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
[1,5,2,3,4] => 24
[1,5,2,4,3] => 6
[1,5,3,2,4] => 8
[1,5,3,4,2] => 4
[1,5,4,2,3] => 6
[1,5,4,3,2] => 2
[2,1,3,4,5] => 60
[2,1,3,5,4] => 12
[2,1,4,3,5] => 15
[2,1,4,5,3] => 6
[2,1,5,3,4] => 12
[2,1,5,4,3] => 3
[2,3,1,4,5] => 40
[2,3,1,5,4] => 8
[2,3,4,1,5] => 30
[2,3,4,5,1] => 24
[2,3,5,1,4] => 8
[2,3,5,4,1] => 6
[2,4,1,3,5] => 15
[2,4,1,5,3] => 6
[2,4,3,1,5] => 10
[2,4,3,5,1] => 8
[2,4,5,1,3] => 6
[2,4,5,3,1] => 4
[2,5,1,3,4] => 12
[2,5,1,4,3] => 3
[2,5,3,1,4] => 8
[2,5,3,4,1] => 6
[2,5,4,1,3] => 3
[2,5,4,3,1] => 2
[3,1,2,4,5] => 40
[3,1,2,5,4] => 8
[3,1,4,2,5] => 20
[3,1,4,5,2] => 12
[3,1,5,2,4] => 8
[3,1,5,4,2] => 4
[3,2,1,4,5] => 20
[3,2,1,5,4] => 4
[3,2,4,1,5] => 15
[3,2,4,5,1] => 12
[3,2,5,1,4] => 4
[3,2,5,4,1] => 3
[3,4,1,2,5] => 20
[3,4,1,5,2] => 12
[3,4,2,1,5] => 10
[3,4,2,5,1] => 8
[3,4,5,1,2] => 12
[3,4,5,2,1] => 6
[3,5,1,2,4] => 8
[3,5,1,4,2] => 4
[3,5,2,1,4] => 4
>>> Load all 872 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 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.
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.
Code
from collections import defaultdict
@cached_function
def PF_to_Perms(n):
out = defaultdict(list)
for pf in ParkingFunctions(n):
out[pf.parking_permutation()].append(pf)
return out
def statistic(pi):
return len(PF_to_Perms(len(pi))[pi])
Created
Jan 26, 2019 at 13:10 by Raman Sanyal
Updated
Feb 09, 2021 at 15:34 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!