Your data matches 3 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000143
St000143: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> 0
[2]
=> 0
[1,1]
=> 1
[3]
=> 0
[2,1]
=> 0
[1,1,1]
=> 1
[4]
=> 0
[3,1]
=> 0
[2,2]
=> 2
[2,1,1]
=> 1
[1,1,1,1]
=> 1
[5]
=> 0
[4,1]
=> 0
[3,2]
=> 0
[3,1,1]
=> 1
[2,2,1]
=> 2
[2,1,1,1]
=> 1
[1,1,1,1,1]
=> 1
[6]
=> 0
[5,1]
=> 0
[4,2]
=> 0
[4,1,1]
=> 1
[3,3]
=> 3
[3,2,1]
=> 0
[3,1,1,1]
=> 1
[2,2,2]
=> 2
[2,2,1,1]
=> 2
[2,1,1,1,1]
=> 1
[1,1,1,1,1,1]
=> 1
[7]
=> 0
[6,1]
=> 0
[5,2]
=> 0
[5,1,1]
=> 1
[4,3]
=> 0
[4,2,1]
=> 0
[4,1,1,1]
=> 1
[3,3,1]
=> 3
[3,2,2]
=> 2
[3,2,1,1]
=> 1
[3,1,1,1,1]
=> 1
[2,2,2,1]
=> 2
[2,2,1,1,1]
=> 2
[2,1,1,1,1,1]
=> 1
[1,1,1,1,1,1,1]
=> 1
[8]
=> 0
[7,1]
=> 0
[6,2]
=> 0
[6,1,1]
=> 1
[5,3]
=> 0
[5,2,1]
=> 0
Description
The largest repeated part of a partition. If the parts of the partition are all distinct, the value of the statistic is defined to be zero.
Matching statistic: St001587
Mp00313: Integer partitions Glaisher-Franklin inverseInteger partitions
St001587: Integer partitions ⟶ ℤResult quality: 99% values known / values provided: 99%distinct values known / distinct values provided: 100%
Values
[1]
=> [1]
=> 0
[2]
=> [1,1]
=> 0
[1,1]
=> [2]
=> 1
[3]
=> [3]
=> 0
[2,1]
=> [1,1,1]
=> 0
[1,1,1]
=> [2,1]
=> 1
[4]
=> [1,1,1,1]
=> 0
[3,1]
=> [3,1]
=> 0
[2,2]
=> [4]
=> 2
[2,1,1]
=> [2,1,1]
=> 1
[1,1,1,1]
=> [2,2]
=> 1
[5]
=> [5]
=> 0
[4,1]
=> [1,1,1,1,1]
=> 0
[3,2]
=> [3,1,1]
=> 0
[3,1,1]
=> [3,2]
=> 1
[2,2,1]
=> [4,1]
=> 2
[2,1,1,1]
=> [2,1,1,1]
=> 1
[1,1,1,1,1]
=> [2,2,1]
=> 1
[6]
=> [3,3]
=> 0
[5,1]
=> [5,1]
=> 0
[4,2]
=> [1,1,1,1,1,1]
=> 0
[4,1,1]
=> [2,1,1,1,1]
=> 1
[3,3]
=> [6]
=> 3
[3,2,1]
=> [3,1,1,1]
=> 0
[3,1,1,1]
=> [3,2,1]
=> 1
[2,2,2]
=> [4,1,1]
=> 2
[2,2,1,1]
=> [4,2]
=> 2
[2,1,1,1,1]
=> [2,2,1,1]
=> 1
[1,1,1,1,1,1]
=> [2,2,2]
=> 1
[7]
=> [7]
=> 0
[6,1]
=> [3,3,1]
=> 0
[5,2]
=> [5,1,1]
=> 0
[5,1,1]
=> [5,2]
=> 1
[4,3]
=> [3,1,1,1,1]
=> 0
[4,2,1]
=> [1,1,1,1,1,1,1]
=> 0
[4,1,1,1]
=> [2,1,1,1,1,1]
=> 1
[3,3,1]
=> [6,1]
=> 3
[3,2,2]
=> [4,3]
=> 2
[3,2,1,1]
=> [3,2,1,1]
=> 1
[3,1,1,1,1]
=> [3,2,2]
=> 1
[2,2,2,1]
=> [4,1,1,1]
=> 2
[2,2,1,1,1]
=> [4,2,1]
=> 2
[2,1,1,1,1,1]
=> [2,2,1,1,1]
=> 1
[1,1,1,1,1,1,1]
=> [2,2,2,1]
=> 1
[8]
=> [1,1,1,1,1,1,1,1]
=> 0
[7,1]
=> [7,1]
=> 0
[6,2]
=> [3,3,1,1]
=> 0
[6,1,1]
=> [3,3,2]
=> 1
[5,3]
=> [5,3]
=> 0
[5,2,1]
=> [5,1,1,1]
=> 0
[]
=> ?
=> ? = 0
Description
Half of the largest even part of an integer partition. The largest even part is recorded by [[St000995]].
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00023: Dyck paths to non-crossing permutationPermutations
St001685: Permutations ⟶ ℤResult quality: 71% values known / values provided: 71%distinct values known / distinct values provided: 83%
Values
[1]
=> [1,0,1,0]
=> [1,2] => 0
[2]
=> [1,1,0,0,1,0]
=> [2,1,3] => 0
[1,1]
=> [1,0,1,1,0,0]
=> [1,3,2] => 1
[3]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 0
[2,1]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 1
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => 0
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 0
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 1
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 1
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [5,4,3,2,1,6] => 0
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,2,3,1,5] => 0
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 0
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 2
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => 1
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,6,5,4,3,2] => 1
[6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [6,5,4,3,2,1,7] => ? = 0
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [5,3,4,2,1,6] => 0
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => 0
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => 3
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 2
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 2
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,6,4,5,3,2] => 1
[1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,7,6,5,4,3,2] => ? = 1
[7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [7,6,5,4,3,2,1,8] => ? = 0
[6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [6,5,3,4,2,1,7] => ? = 0
[5,2]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [5,3,2,4,1,6] => 0
[5,1,1]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> [5,2,4,3,1,6] => 1
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 0
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 0
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 1
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 3
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 2
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 1
[3,1,1,1,1]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,6,4,3,5,2] => 1
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 2
[2,2,1,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,6,3,5,4,2] => 2
[2,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,7,6,4,5,3,2] => ? = 1
[1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,8,7,6,5,4,3,2] => ? = 1
[8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [8,7,6,5,4,3,2,1,9] => ? = 0
[7,1]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0,1,0]
=> [7,6,4,5,3,2,1,8] => ? = 0
[6,2]
=> [1,1,1,1,1,0,0,1,0,0,0,0,1,0]
=> [6,4,3,5,2,1,7] => ? = 0
[6,1,1]
=> [1,1,1,1,0,1,1,0,0,0,0,0,1,0]
=> [6,3,5,4,2,1,7] => ? = 1
[5,3]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [4,3,2,5,1,6] => 0
[5,2,1]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> [5,2,3,4,1,6] => 0
[5,1,1,1]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> [2,5,4,3,1,6] => 1
[4,4]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [4,3,2,1,6,5] => 4
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 0
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 2
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 1
[4,1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,5,4,3,6,2] => 1
[3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 3
[3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 3
[3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 2
[3,2,1,1,1]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,6,3,4,5,2] => 1
[3,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,7,5,4,6,3,2] => ? = 1
[2,2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,7,4,6,5,3,2] => ? = 2
[2,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> [1,8,7,5,6,4,3,2] => ? = 1
[1,1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [1,9,8,7,6,5,4,3,2] => ? = 1
[9]
=> [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0]
=> [9,8,7,6,5,4,3,2,1,10] => ? = 0
[8,1]
=> [1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,1,0]
=> [8,7,6,4,5,3,2,1,9] => ? = 0
[7,2]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0,1,0]
=> [7,6,4,3,5,2,1,8] => ? = 0
[7,1,1]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0,1,0]
=> [7,6,3,5,4,2,1,8] => ? = 1
[6,3]
=> [1,1,1,1,1,0,0,0,1,0,0,0,1,0]
=> [6,4,3,2,5,1,7] => ? = 0
[6,2,1]
=> [1,1,1,1,0,1,0,1,0,0,0,0,1,0]
=> [6,3,4,5,2,1,7] => ? = 0
[6,1,1,1]
=> [1,1,1,0,1,1,1,0,0,0,0,0,1,0]
=> [6,2,5,4,3,1,7] => ? = 1
[4,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,7,5,4,3,6,2] => ? = 1
[3,2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,1,0,0,0,0]
=> [1,7,4,5,6,3,2] => ? = 1
[3,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> [1,8,7,5,4,6,3,2] => ? = 1
[2,2,2,1,1,1]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,7,3,6,5,4,2] => ? = 2
[2,2,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> [1,8,7,4,6,5,3,2] => ? = 2
[2,1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0]
=> [1,9,8,7,5,6,4,3,2] => ? = 1
[1,1,1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0]
=> [1,10,9,8,7,6,5,4,3,2] => ? = 1
[10]
=> [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,0]
=> [10,9,8,7,6,5,4,3,2,1,11] => ? = 0
[9,1]
=> [1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0,1,0]
=> [9,8,7,5,6,4,3,2,1,10] => ? = 0
[8,2]
=> [1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,1,0]
=> [8,7,5,4,6,3,2,1,9] => ? = 0
[8,1,1]
=> [1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,1,0]
=> [8,7,4,6,5,3,2,1,9] => ? = 1
[7,3]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0,1,0]
=> [7,5,4,3,6,2,1,8] => ? = 0
[7,2,1]
=> [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
=> [7,6,3,4,5,2,1,8] => ? = 0
[7,1,1,1]
=> [1,1,1,1,0,1,1,1,0,0,0,0,0,0,1,0]
=> [7,3,6,5,4,2,1,8] => ? = 1
[6,4]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0]
=> [5,4,3,2,6,1,7] => ? = 0
[6,3,1]
=> [1,1,1,1,0,1,0,0,1,0,0,0,1,0]
=> [6,3,4,2,5,1,7] => ? = 0
[6,2,2]
=> [1,1,1,1,0,0,1,1,0,0,0,0,1,0]
=> [6,3,2,5,4,1,7] => ? = 2
[6,2,1,1]
=> [1,1,1,0,1,1,0,1,0,0,0,0,1,0]
=> [6,2,4,5,3,1,7] => ? = 1
[6,1,1,1,1]
=> [1,1,0,1,1,1,1,0,0,0,0,0,1,0]
=> [2,6,5,4,3,1,7] => ? = 1
[5,5]
=> [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [5,4,3,2,1,7,6] => ? = 5
[5,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,6,5,4,3,7,2] => ? = 1
[4,2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,1,0,0,0]
=> [1,7,4,5,3,6,2] => ? = 1
[4,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> [1,8,6,5,4,7,3,2] => ? = 1
[3,3,1,1,1,1]
=> [1,0,1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,7,4,3,6,5,2] => ? = 3
[3,2,2,1,1,1]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,7,3,5,6,4,2] => ? = 2
[3,2,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,1,0,1,0,0,0,0,0]
=> [1,8,7,4,5,6,3,2] => ? = 1
[3,1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0]
=> [1,9,8,6,5,7,4,3,2] => ? = 1
[2,2,2,2,2]
=> [1,1,0,0,1,1,1,1,1,0,0,0,0,0]
=> [2,1,7,6,5,4,3] => ? = 2
[2,2,2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> [1,8,4,7,6,5,3,2] => ? = 2
Description
The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation.