Your data matches 205 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000897
Mapping
Mp00107: Semistandard tableaux —catabolism⟶ Semistandard tableaux
Mp00077: Semistandard tableaux —shape⟶ Integer partitions
St000897: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1,4],[2],[3]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => 2
[[1],[2],[3],[4]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => 2
[[1,5],[2],[3]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => 2
[[1,5],[2],[4]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => 2
[[1,5],[3],[4]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => 2
[[2,5],[3],[4]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => 2
[[1],[2],[3],[5]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => 2
[[1],[2],[4],[5]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => 2
[[1],[3],[4],[5]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => 2
[[2],[3],[4],[5]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => 2
[[1,1,4],[2],[3]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => 2
[[1,2,4],[2],[3]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => 2
[[1,3,4],[2],[3]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => 2
[[1,4,4],[2],[3]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => 2
[[1,1],[2],[3],[4]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => 2
[[1,2],[2],[3],[4]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => 2
[[1,3],[2],[3],[4]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => 2
[[1,4],[2],[3],[4]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => 2
[[1,1,3,3],[2,2]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => 1
[[1,1,3],[2,2],[3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => 1
[[1,1],[2,2],[3,3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => 1
[[1,6],[2],[3]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => 2
[[1,6],[2],[4]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => 2
[[1,6],[2],[5]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => 2
[[1,6],[3],[4]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => 2
[[1,6],[3],[5]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => 2
[[1,6],[4],[5]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => 2
[[2,6],[3],[4]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => 2
[[2,6],[3],[5]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => 2
[[2,6],[4],[5]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => 2
[[3,6],[4],[5]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => 2
[[1],[2],[3],[6]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => 2
[[1],[2],[4],[6]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => 2
[[1],[2],[5],[6]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => 2
[[1],[3],[4],[6]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => 2
[[1],[3],[5],[6]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => 2
[[1],[4],[5],[6]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => 2
[[2],[3],[4],[6]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => 2
[[2],[3],[5],[6]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => 2
[[2],[4],[5],[6]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => 2
[[3],[4],[5],[6]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => 2
[[1,3,5],[2,4]]
 => [[1,2,4],[3,5]]
 => [3,2]
 => 1
[[1,1,5],[2],[3]]
 => [[1,1,2],[3],[5]]
 => [3,1,1]
 => 2
[[1,1,5],[2],[4]]
 => [[1,1,2],[4],[5]]
 => [3,1,1]
 => 2
[[1,1,5],[3],[4]]
 => [[1,1,3],[4],[5]]
 => [3,1,1]
 => 2
[[1,2,5],[2],[3]]
 => [[1,2,2],[3],[5]]
 => [3,1,1]
 => 2
[[1,2,5],[2],[4]]
 => [[1,2,2],[4],[5]]
 => [3,1,1]
 => 2
[[1,3,5],[2],[3]]
 => [[1,2,3],[3],[5]]
 => [3,1,1]
 => 2
[[1,2,5],[3],[4]]
 => [[1,2,3],[4],[5]]
 => [3,1,1]
 => 2
[[1,3,5],[2],[4]]
 => [[1,2,4],[3],[5]]
 => [3,1,1]
 => 2
Description
The number of different multiplicities of parts of an integer partition.
Matching statistic: St001568
(load all 2 compositions to match this statistic)
Mapping
Mp00107: Semistandard tableaux —catabolism⟶ Semistandard tableaux
Mp00077: Semistandard tableaux —shape⟶ Integer partitions
St001568: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1,4],[2],[3]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => 2
[[1],[2],[3],[4]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => 2
[[1,5],[2],[3]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => 2
[[1,5],[2],[4]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => 2
[[1,5],[3],[4]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => 2
[[2,5],[3],[4]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => 2
[[1],[2],[3],[5]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => 2
[[1],[2],[4],[5]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => 2
[[1],[3],[4],[5]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => 2
[[2],[3],[4],[5]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => 2
[[1,1,4],[2],[3]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => 2
[[1,2,4],[2],[3]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => 2
[[1,3,4],[2],[3]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => 2
[[1,4,4],[2],[3]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => 2
[[1,1],[2],[3],[4]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => 2
[[1,2],[2],[3],[4]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => 2
[[1,3],[2],[3],[4]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => 2
[[1,4],[2],[3],[4]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => 2
[[1,1,3,3],[2,2]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => 1
[[1,1,3],[2,2],[3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => 1
[[1,1],[2,2],[3,3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => 1
[[1,6],[2],[3]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => 2
[[1,6],[2],[4]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => 2
[[1,6],[2],[5]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => 2
[[1,6],[3],[4]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => 2
[[1,6],[3],[5]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => 2
[[1,6],[4],[5]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => 2
[[2,6],[3],[4]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => 2
[[2,6],[3],[5]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => 2
[[2,6],[4],[5]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => 2
[[3,6],[4],[5]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => 2
[[1],[2],[3],[6]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => 2
[[1],[2],[4],[6]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => 2
[[1],[2],[5],[6]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => 2
[[1],[3],[4],[6]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => 2
[[1],[3],[5],[6]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => 2
[[1],[4],[5],[6]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => 2
[[2],[3],[4],[6]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => 2
[[2],[3],[5],[6]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => 2
[[2],[4],[5],[6]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => 2
[[3],[4],[5],[6]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => 2
[[1,3,5],[2,4]]
 => [[1,2,4],[3,5]]
 => [3,2]
 => 1
[[1,1,5],[2],[3]]
 => [[1,1,2],[3],[5]]
 => [3,1,1]
 => 2
[[1,1,5],[2],[4]]
 => [[1,1,2],[4],[5]]
 => [3,1,1]
 => 2
[[1,1,5],[3],[4]]
 => [[1,1,3],[4],[5]]
 => [3,1,1]
 => 2
[[1,2,5],[2],[3]]
 => [[1,2,2],[3],[5]]
 => [3,1,1]
 => 2
[[1,2,5],[2],[4]]
 => [[1,2,2],[4],[5]]
 => [3,1,1]
 => 2
[[1,3,5],[2],[3]]
 => [[1,2,3],[3],[5]]
 => [3,1,1]
 => 2
[[1,2,5],[3],[4]]
 => [[1,2,3],[4],[5]]
 => [3,1,1]
 => 2
[[1,3,5],[2],[4]]
 => [[1,2,4],[3],[5]]
 => [3,1,1]
 => 2
Description
The smallest positive integer that does not appear twice in the partition.
Matching statistic: St000143
(load all 2 compositions to match this statistic)
Mapping
Mp00107: Semistandard tableaux —catabolism⟶ Semistandard tableaux
Mp00077: Semistandard tableaux —shape⟶ Integer partitions
St000143: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1,4],[2],[3]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[3],[4]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,5],[2],[3]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,5],[2],[4]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,5],[3],[4]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[2,5],[3],[4]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[3],[5]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[4],[5]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[3],[4],[5]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[3],[4],[5]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,1,4],[2],[3]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,2,4],[2],[3]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,3,4],[2],[3]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,4,4],[2],[3]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,1],[2],[3],[4]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,2],[2],[3],[4]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,3],[2],[3],[4]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,4],[2],[3],[4]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,1,3,3],[2,2]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => 0 = 1 - 1
[[1,1,3],[2,2],[3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => 0 = 1 - 1
[[1,1],[2,2],[3,3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => 0 = 1 - 1
[[1,6],[2],[3]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[2],[4]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[2],[5]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[3],[4]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[3],[5]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[4],[5]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[2,6],[3],[4]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[2,6],[3],[5]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[2,6],[4],[5]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[3,6],[4],[5]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[3],[6]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[4],[6]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[5],[6]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[3],[4],[6]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[3],[5],[6]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[4],[5],[6]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[3],[4],[6]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[3],[5],[6]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[4],[5],[6]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[3],[4],[5],[6]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,3,5],[2,4]]
 => [[1,2,4],[3,5]]
 => [3,2]
 => 0 = 1 - 1
[[1,1,5],[2],[3]]
 => [[1,1,2],[3],[5]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,1,5],[2],[4]]
 => [[1,1,2],[4],[5]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,1,5],[3],[4]]
 => [[1,1,3],[4],[5]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,2,5],[2],[3]]
 => [[1,2,2],[3],[5]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,2,5],[2],[4]]
 => [[1,2,2],[4],[5]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,3,5],[2],[3]]
 => [[1,2,3],[3],[5]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,2,5],[3],[4]]
 => [[1,2,3],[4],[5]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,3,5],[2],[4]]
 => [[1,2,4],[3],[5]]
 => [3,1,1]
 => 1 = 2 - 1
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: St000257
(load all 2 compositions to match this statistic)
Mapping
Mp00107: Semistandard tableaux —catabolism⟶ Semistandard tableaux
Mp00077: Semistandard tableaux —shape⟶ Integer partitions
St000257: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1,4],[2],[3]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[3],[4]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,5],[2],[3]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,5],[2],[4]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,5],[3],[4]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[2,5],[3],[4]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[3],[5]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[4],[5]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[3],[4],[5]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[3],[4],[5]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,1,4],[2],[3]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,2,4],[2],[3]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,3,4],[2],[3]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,4,4],[2],[3]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,1],[2],[3],[4]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,2],[2],[3],[4]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,3],[2],[3],[4]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,4],[2],[3],[4]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,1,3,3],[2,2]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => 0 = 1 - 1
[[1,1,3],[2,2],[3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => 0 = 1 - 1
[[1,1],[2,2],[3,3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => 0 = 1 - 1
[[1,6],[2],[3]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[2],[4]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[2],[5]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[3],[4]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[3],[5]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[4],[5]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[2,6],[3],[4]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[2,6],[3],[5]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[2,6],[4],[5]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[3,6],[4],[5]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[3],[6]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[4],[6]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[5],[6]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[3],[4],[6]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[3],[5],[6]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[4],[5],[6]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[3],[4],[6]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[3],[5],[6]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[4],[5],[6]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[3],[4],[5],[6]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => 1 = 2 - 1
[[1,3,5],[2,4]]
 => [[1,2,4],[3,5]]
 => [3,2]
 => 0 = 1 - 1
[[1,1,5],[2],[3]]
 => [[1,1,2],[3],[5]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,1,5],[2],[4]]
 => [[1,1,2],[4],[5]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,1,5],[3],[4]]
 => [[1,1,3],[4],[5]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,2,5],[2],[3]]
 => [[1,2,2],[3],[5]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,2,5],[2],[4]]
 => [[1,2,2],[4],[5]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,3,5],[2],[3]]
 => [[1,2,3],[3],[5]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,2,5],[3],[4]]
 => [[1,2,3],[4],[5]]
 => [3,1,1]
 => 1 = 2 - 1
[[1,3,5],[2],[4]]
 => [[1,2,4],[3],[5]]
 => [3,1,1]
 => 1 = 2 - 1
Description
The number of distinct parts of a partition that occur at least twice. See Section 3.3.1 of [2].
Matching statistic: St000256
Mapping
Mp00107: Semistandard tableaux —catabolism⟶ Semistandard tableaux
Mp00077: Semistandard tableaux —shape⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St000256: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1,4],[2],[3]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1],[2],[3],[4]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1,5],[2],[3]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1,5],[2],[4]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1,5],[3],[4]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[2,5],[3],[4]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1],[2],[3],[5]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1],[2],[4],[5]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1],[3],[4],[5]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[2],[3],[4],[5]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1,1,4],[2],[3]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
[[1,2,4],[2],[3]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
[[1,3,4],[2],[3]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
[[1,4,4],[2],[3]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
[[1,1],[2],[3],[4]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
[[1,2],[2],[3],[4]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
[[1,3],[2],[3],[4]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
[[1,4],[2],[3],[4]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
[[1,1,3,3],[2,2]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [2,2,1,1]
 => 0 = 1 - 1
[[1,1,3],[2,2],[3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [2,2,1,1]
 => 0 = 1 - 1
[[1,1],[2,2],[3,3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [2,2,1,1]
 => 0 = 1 - 1
[[1,6],[2],[3]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1,6],[2],[4]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1,6],[2],[5]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1,6],[3],[4]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1,6],[3],[5]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1,6],[4],[5]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[2,6],[3],[4]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[2,6],[3],[5]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[2,6],[4],[5]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[3,6],[4],[5]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1],[2],[3],[6]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1],[2],[4],[6]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1],[2],[5],[6]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1],[3],[4],[6]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1],[3],[5],[6]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1],[4],[5],[6]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[2],[3],[4],[6]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[2],[3],[5],[6]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[2],[4],[5],[6]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[3],[4],[5],[6]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => [3,1]
 => 1 = 2 - 1
[[1,3,5],[2,4]]
 => [[1,2,4],[3,5]]
 => [3,2]
 => [2,2,1]
 => 0 = 1 - 1
[[1,1,5],[2],[3]]
 => [[1,1,2],[3],[5]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
[[1,1,5],[2],[4]]
 => [[1,1,2],[4],[5]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
[[1,1,5],[3],[4]]
 => [[1,1,3],[4],[5]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
[[1,2,5],[2],[3]]
 => [[1,2,2],[3],[5]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
[[1,2,5],[2],[4]]
 => [[1,2,2],[4],[5]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
[[1,3,5],[2],[3]]
 => [[1,2,3],[3],[5]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
[[1,2,5],[3],[4]]
 => [[1,2,3],[4],[5]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
[[1,3,5],[2],[4]]
 => [[1,2,4],[3],[5]]
 => [3,1,1]
 => [3,1,1]
 => 1 = 2 - 1
Description
The number of parts from which one can substract 2 and still get an integer partition.
Matching statistic: St000929
Mapping
Mp00107: Semistandard tableaux —catabolism⟶ Semistandard tableaux
Mp00077: Semistandard tableaux —shape⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000929: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1,4],[2],[3]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1],[2],[3],[4]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,5],[2],[3]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,5],[2],[4]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,5],[3],[4]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[2,5],[3],[4]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1],[2],[3],[5]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1],[2],[4],[5]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1],[3],[4],[5]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[2],[3],[4],[5]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,1,4],[2],[3]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,2,4],[2],[3]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,3,4],[2],[3]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,4,4],[2],[3]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,1],[2],[3],[4]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,2],[2],[3],[4]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,3],[2],[3],[4]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,4],[2],[3],[4]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,1,3,3],[2,2]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [2]
 => 0 = 1 - 1
[[1,1,3],[2,2],[3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [2]
 => 0 = 1 - 1
[[1,1],[2,2],[3,3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [2]
 => 0 = 1 - 1
[[1,6],[2],[3]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,6],[2],[4]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,6],[2],[5]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,6],[3],[4]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,6],[3],[5]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,6],[4],[5]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[2,6],[3],[4]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[2,6],[3],[5]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[2,6],[4],[5]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[3,6],[4],[5]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1],[2],[3],[6]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1],[2],[4],[6]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1],[2],[5],[6]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1],[3],[4],[6]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1],[3],[5],[6]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1],[4],[5],[6]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[2],[3],[4],[6]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[2],[3],[5],[6]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[2],[4],[5],[6]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[3],[4],[5],[6]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,3,5],[2,4]]
 => [[1,2,4],[3,5]]
 => [3,2]
 => [2]
 => 0 = 1 - 1
[[1,1,5],[2],[3]]
 => [[1,1,2],[3],[5]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,1,5],[2],[4]]
 => [[1,1,2],[4],[5]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,1,5],[3],[4]]
 => [[1,1,3],[4],[5]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,2,5],[2],[3]]
 => [[1,2,2],[3],[5]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,2,5],[2],[4]]
 => [[1,2,2],[4],[5]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,3,5],[2],[3]]
 => [[1,2,3],[3],[5]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,2,5],[3],[4]]
 => [[1,2,3],[4],[5]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
[[1,3,5],[2],[4]]
 => [[1,2,4],[3],[5]]
 => [3,1,1]
 => [1,1]
 => 1 = 2 - 1
Description
The constant term of the character polynomial of an integer partition. The definition of the character polynomial can be found in [1]. Indeed, this constant term is $0$ for partitions $\lambda \neq 1^n$ and $1$ for $\lambda = 1^n$.
Matching statistic: St001092
Mapping
Mp00107: Semistandard tableaux —catabolism⟶ Semistandard tableaux
Mp00077: Semistandard tableaux —shape⟶ Integer partitions
Mp00313: Integer partitions —Glaisher-Franklin inverse⟶ Integer partitions
St001092: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1,4],[2],[3]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[3],[4]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,5],[2],[3]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,5],[2],[4]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,5],[3],[4]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2,5],[3],[4]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[3],[5]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[4],[5]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[3],[4],[5]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[3],[4],[5]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,1,4],[2],[3]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,2,4],[2],[3]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,3,4],[2],[3]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,4,4],[2],[3]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,1],[2],[3],[4]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,2],[2],[3],[4]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,3],[2],[3],[4]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,4],[2],[3],[4]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,1,3,3],[2,2]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [1,1,1,1,1,1]
 => 0 = 1 - 1
[[1,1,3],[2,2],[3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [1,1,1,1,1,1]
 => 0 = 1 - 1
[[1,1],[2,2],[3,3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [1,1,1,1,1,1]
 => 0 = 1 - 1
[[1,6],[2],[3]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[2],[4]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[2],[5]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[3],[4]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[3],[5]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[4],[5]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2,6],[3],[4]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2,6],[3],[5]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2,6],[4],[5]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[3,6],[4],[5]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[3],[6]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[4],[6]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[5],[6]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[3],[4],[6]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[3],[5],[6]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[4],[5],[6]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[3],[4],[6]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[3],[5],[6]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[4],[5],[6]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[3],[4],[5],[6]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,3,5],[2,4]]
 => [[1,2,4],[3,5]]
 => [3,2]
 => [3,1,1]
 => 0 = 1 - 1
[[1,1,5],[2],[3]]
 => [[1,1,2],[3],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,1,5],[2],[4]]
 => [[1,1,2],[4],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,1,5],[3],[4]]
 => [[1,1,3],[4],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,2,5],[2],[3]]
 => [[1,2,2],[3],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,2,5],[2],[4]]
 => [[1,2,2],[4],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,3,5],[2],[3]]
 => [[1,2,3],[3],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,2,5],[3],[4]]
 => [[1,2,3],[4],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,3,5],[2],[4]]
 => [[1,2,4],[3],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
Description
The number of distinct even parts of a partition. See Section 3.3.1 of [1].
Matching statistic: St001587
Mapping
Mp00107: Semistandard tableaux —catabolism⟶ Semistandard tableaux
Mp00077: Semistandard tableaux —shape⟶ Integer partitions
Mp00313: Integer partitions —Glaisher-Franklin inverse⟶ Integer partitions
St001587: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1,4],[2],[3]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[3],[4]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,5],[2],[3]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,5],[2],[4]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,5],[3],[4]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2,5],[3],[4]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[3],[5]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[4],[5]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[3],[4],[5]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[3],[4],[5]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,1,4],[2],[3]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,2,4],[2],[3]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,3,4],[2],[3]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,4,4],[2],[3]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,1],[2],[3],[4]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,2],[2],[3],[4]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,3],[2],[3],[4]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,4],[2],[3],[4]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,1,3,3],[2,2]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [1,1,1,1,1,1]
 => 0 = 1 - 1
[[1,1,3],[2,2],[3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [1,1,1,1,1,1]
 => 0 = 1 - 1
[[1,1],[2,2],[3,3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [1,1,1,1,1,1]
 => 0 = 1 - 1
[[1,6],[2],[3]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[2],[4]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[2],[5]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[3],[4]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[3],[5]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,6],[4],[5]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2,6],[3],[4]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2,6],[3],[5]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2,6],[4],[5]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[3,6],[4],[5]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[3],[6]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[4],[6]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[2],[5],[6]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[3],[4],[6]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[3],[5],[6]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1],[4],[5],[6]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[3],[4],[6]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[3],[5],[6]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[2],[4],[5],[6]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[3],[4],[5],[6]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => [2,1,1]
 => 1 = 2 - 1
[[1,3,5],[2,4]]
 => [[1,2,4],[3,5]]
 => [3,2]
 => [3,1,1]
 => 0 = 1 - 1
[[1,1,5],[2],[3]]
 => [[1,1,2],[3],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,1,5],[2],[4]]
 => [[1,1,2],[4],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,1,5],[3],[4]]
 => [[1,1,3],[4],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,2,5],[2],[3]]
 => [[1,2,2],[3],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,2,5],[2],[4]]
 => [[1,2,2],[4],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,3,5],[2],[3]]
 => [[1,2,3],[3],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,2,5],[3],[4]]
 => [[1,2,3],[4],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
[[1,3,5],[2],[4]]
 => [[1,2,4],[3],[5]]
 => [3,1,1]
 => [3,2]
 => 1 = 2 - 1
Description
Half of the largest even part of an integer partition. The largest even part is recorded by [[St000995]].
Matching statistic: St001732
Mapping
Mp00107: Semistandard tableaux —catabolism⟶ Semistandard tableaux
Mp00077: Semistandard tableaux —shape⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001732: Dyck paths ⟶ ℤResult quality: 84% ●values known / values provided: 84%●distinct values known / distinct values provided: 100%
Values
[[1,4],[2],[3]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1],[2],[3],[4]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1,5],[2],[3]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1,5],[2],[4]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1,5],[3],[4]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[2,5],[3],[4]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1],[2],[3],[5]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1],[2],[4],[5]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1],[3],[4],[5]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[2],[3],[4],[5]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1,1,4],[2],[3]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,2,4],[2],[3]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,3,4],[2],[3]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,4,4],[2],[3]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,1],[2],[3],[4]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,2],[2],[3],[4]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,3],[2],[3],[4]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,4],[2],[3],[4]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,1,3,3],[2,2]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 1
[[1,1,3],[2,2],[3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 1
[[1,1],[2,2],[3,3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 1
[[1,6],[2],[3]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1,6],[2],[4]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1,6],[2],[5]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1,6],[3],[4]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1,6],[3],[5]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1,6],[4],[5]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[2,6],[3],[4]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[2,6],[3],[5]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[2,6],[4],[5]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[3,6],[4],[5]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1],[2],[3],[6]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1],[2],[4],[6]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1],[2],[5],[6]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1],[3],[4],[6]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1],[3],[5],[6]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1],[4],[5],[6]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[2],[3],[4],[6]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[2],[3],[5],[6]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[2],[4],[5],[6]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[3],[4],[5],[6]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[1,3,5],[2,4]]
 => [[1,2,4],[3,5]]
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 1
[[1,1,5],[2],[3]]
 => [[1,1,2],[3],[5]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,1,5],[2],[4]]
 => [[1,1,2],[4],[5]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,1,5],[3],[4]]
 => [[1,1,3],[4],[5]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,2,5],[2],[3]]
 => [[1,2,2],[3],[5]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,2,5],[2],[4]]
 => [[1,2,2],[4],[5]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,3,5],[2],[3]]
 => [[1,2,3],[3],[5]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,2,5],[3],[4]]
 => [[1,2,3],[4],[5]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,3,5],[2],[4]]
 => [[1,2,4],[3],[5]]
 => [3,1,1]
 => [1,0,1,1,0,0,1,0]
 => 2
[[1,1,1,1],[2,2,2],[3,3],[4]]
 => [[1,1,1,1,2,2,2],[3,3],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,2],[2,2,2],[3,3],[4]]
 => [[1,1,1,2,2,2,2],[3,3],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,1],[2,2,3],[3,3],[4]]
 => [[1,1,1,1,2,2,3],[3,3],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,2],[2,2,3],[3,3],[4]]
 => [[1,1,1,2,2,2,3],[3,3],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,3],[2,2,3],[3,3],[4]]
 => [[1,1,1,2,2,3,3],[3,3],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,2,2],[2,2,3],[3,3],[4]]
 => [[1,1,2,2,2,2,3],[3,3],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,2,3],[2,2,3],[3,3],[4]]
 => [[1,1,2,2,2,3,3],[3,3],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,1],[2,2,2],[3,4],[4]]
 => [[1,1,1,1,2,2,2],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,2],[2,2,2],[3,4],[4]]
 => [[1,1,1,2,2,2,2],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,1],[2,2,3],[3,4],[4]]
 => [[1,1,1,1,2,2,3],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,2],[2,2,3],[3,4],[4]]
 => [[1,1,1,2,2,2,3],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,2,2],[2,2,3],[3,4],[4]]
 => [[1,1,2,2,2,2,3],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,1],[2,2,4],[3,4],[4]]
 => [[1,1,1,1,2,2,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,2],[2,2,4],[3,4],[4]]
 => [[1,1,1,2,2,2,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,3],[2,2,4],[3,4],[4]]
 => [[1,1,1,2,2,4,4],[3,3],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,4],[2,2,4],[3,4],[4]]
 => [[1,1,1,2,2,4,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,2,2],[2,2,4],[3,4],[4]]
 => [[1,1,2,2,2,2,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,2,3],[2,2,4],[3,4],[4]]
 => [[1,1,2,2,2,4,4],[3,3],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,2,4],[2,2,4],[3,4],[4]]
 => [[1,1,2,2,2,4,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,1],[2,3,3],[3,4],[4]]
 => [[1,1,1,1,2,3,3],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,2],[2,3,3],[3,4],[4]]
 => [[1,1,1,2,2,3,3],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,3],[2,3,3],[3,4],[4]]
 => [[1,1,1,2,3,3,3],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,2,2],[2,3,3],[3,4],[4]]
 => [[1,1,2,2,2,3,3],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,2,3],[2,3,3],[3,4],[4]]
 => [[1,1,2,2,3,3,3],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,1],[2,3,4],[3,4],[4]]
 => [[1,1,1,1,2,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,2],[2,3,4],[3,4],[4]]
 => [[1,1,1,2,2,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,3],[2,3,4],[3,4],[4]]
 => [[1,1,1,2,3,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,1,4],[2,3,4],[3,4],[4]]
 => [[1,1,1,2,3,4,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,2,2],[2,3,4],[3,4],[4]]
 => [[1,1,2,2,2,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,2,3],[2,3,4],[3,4],[4]]
 => [[1,1,2,2,3,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,2,4],[2,3,4],[3,4],[4]]
 => [[1,1,2,2,3,4,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,3,3],[2,3,4],[3,4],[4]]
 => [[1,1,2,3,3,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,1,3,4],[2,3,4],[3,4],[4]]
 => [[1,1,2,3,3,4,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,2,2,2],[2,3,3],[3,4],[4]]
 => [[1,2,2,2,2,3,3],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,2,2,3],[2,3,3],[3,4],[4]]
 => [[1,2,2,2,3,3,3],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,2,2,2],[2,3,4],[3,4],[4]]
 => [[1,2,2,2,2,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,2,2,3],[2,3,4],[3,4],[4]]
 => [[1,2,2,2,3,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,2,2,4],[2,3,4],[3,4],[4]]
 => [[1,2,2,2,3,4,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,2,3,3],[2,3,4],[3,4],[4]]
 => [[1,2,2,3,3,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
[[1,2,3,4],[2,3,4],[3,4],[4]]
 => [[1,2,2,3,3,4,4],[3,4],[4]]
 => [7,2,1]
 => [1,1,1,1,1,0,1,0,1,0,0,0,0,0,1,0]
 => ? = 1
Description
The number of peaks visible from the left. This is, the number of left-to-right maxima of the heights of the peaks of a Dyck path.
Matching statistic: St000658
Mapping
Mp00107: Semistandard tableaux —catabolism⟶ Semistandard tableaux
Mp00077: Semistandard tableaux —shape⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000658: Dyck paths ⟶ ℤResult quality: 84% ●values known / values provided: 84%●distinct values known / distinct values provided: 100%
Values
[[1,4],[2],[3]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1],[2],[3],[4]]
 => [[1,2],[3],[4]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,5],[2],[3]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,5],[2],[4]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,5],[3],[4]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[2,5],[3],[4]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1],[2],[3],[5]]
 => [[1,2],[3],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1],[2],[4],[5]]
 => [[1,2],[4],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1],[3],[4],[5]]
 => [[1,3],[4],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[2],[3],[4],[5]]
 => [[2,3],[4],[5]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,1,4],[2],[3]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,2,4],[2],[3]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,3,4],[2],[3]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,4,4],[2],[3]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,1],[2],[3],[4]]
 => [[1,1,2],[3],[4]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,2],[2],[3],[4]]
 => [[1,2,2],[3],[4]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,3],[2],[3],[4]]
 => [[1,2,3],[3],[4]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,4],[2],[3],[4]]
 => [[1,2,4],[3],[4]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,1,3,3],[2,2]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [1,0,1,0,1,1,1,0,0,0]
 => 0 = 1 - 1
[[1,1,3],[2,2],[3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [1,0,1,0,1,1,1,0,0,0]
 => 0 = 1 - 1
[[1,1],[2,2],[3,3]]
 => [[1,1,2,2],[3,3]]
 => [4,2]
 => [1,0,1,0,1,1,1,0,0,0]
 => 0 = 1 - 1
[[1,6],[2],[3]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,6],[2],[4]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,6],[2],[5]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,6],[3],[4]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,6],[3],[5]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,6],[4],[5]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[2,6],[3],[4]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[2,6],[3],[5]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[2,6],[4],[5]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[3,6],[4],[5]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1],[2],[3],[6]]
 => [[1,2],[3],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1],[2],[4],[6]]
 => [[1,2],[4],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1],[2],[5],[6]]
 => [[1,2],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1],[3],[4],[6]]
 => [[1,3],[4],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1],[3],[5],[6]]
 => [[1,3],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1],[4],[5],[6]]
 => [[1,4],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[2],[3],[4],[6]]
 => [[2,3],[4],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[2],[3],[5],[6]]
 => [[2,3],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[2],[4],[5],[6]]
 => [[2,4],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[3],[4],[5],[6]]
 => [[3,4],[5],[6]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,3,5],[2,4]]
 => [[1,2,4],[3,5]]
 => [3,2]
 => [1,0,1,1,1,0,0,0]
 => 0 = 1 - 1
[[1,1,5],[2],[3]]
 => [[1,1,2],[3],[5]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,1,5],[2],[4]]
 => [[1,1,2],[4],[5]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,1,5],[3],[4]]
 => [[1,1,3],[4],[5]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,2,5],[2],[3]]
 => [[1,2,2],[3],[5]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,2,5],[2],[4]]
 => [[1,2,2],[4],[5]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,3,5],[2],[3]]
 => [[1,2,3],[3],[5]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,2,5],[3],[4]]
 => [[1,2,3],[4],[5]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,3,5],[2],[4]]
 => [[1,2,4],[3],[5]]
 => [3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1 = 2 - 1
[[1,1,1,1],[2,2,2],[3,3],[4]]
 => [[1,1,1,1,2,2,2],[3,3],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,2],[2,2,2],[3,3],[4]]
 => [[1,1,1,2,2,2,2],[3,3],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,1],[2,2,3],[3,3],[4]]
 => [[1,1,1,1,2,2,3],[3,3],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,2],[2,2,3],[3,3],[4]]
 => [[1,1,1,2,2,2,3],[3,3],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,3],[2,2,3],[3,3],[4]]
 => [[1,1,1,2,2,3,3],[3,3],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,2,2],[2,2,3],[3,3],[4]]
 => [[1,1,2,2,2,2,3],[3,3],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,2,3],[2,2,3],[3,3],[4]]
 => [[1,1,2,2,2,3,3],[3,3],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,1],[2,2,2],[3,4],[4]]
 => [[1,1,1,1,2,2,2],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,2],[2,2,2],[3,4],[4]]
 => [[1,1,1,2,2,2,2],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,1],[2,2,3],[3,4],[4]]
 => [[1,1,1,1,2,2,3],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,2],[2,2,3],[3,4],[4]]
 => [[1,1,1,2,2,2,3],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,2,2],[2,2,3],[3,4],[4]]
 => [[1,1,2,2,2,2,3],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,1],[2,2,4],[3,4],[4]]
 => [[1,1,1,1,2,2,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,2],[2,2,4],[3,4],[4]]
 => [[1,1,1,2,2,2,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,3],[2,2,4],[3,4],[4]]
 => [[1,1,1,2,2,4,4],[3,3],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,4],[2,2,4],[3,4],[4]]
 => [[1,1,1,2,2,4,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,2,2],[2,2,4],[3,4],[4]]
 => [[1,1,2,2,2,2,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,2,3],[2,2,4],[3,4],[4]]
 => [[1,1,2,2,2,4,4],[3,3],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,2,4],[2,2,4],[3,4],[4]]
 => [[1,1,2,2,2,4,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,1],[2,3,3],[3,4],[4]]
 => [[1,1,1,1,2,3,3],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,2],[2,3,3],[3,4],[4]]
 => [[1,1,1,2,2,3,3],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,3],[2,3,3],[3,4],[4]]
 => [[1,1,1,2,3,3,3],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,2,2],[2,3,3],[3,4],[4]]
 => [[1,1,2,2,2,3,3],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,2,3],[2,3,3],[3,4],[4]]
 => [[1,1,2,2,3,3,3],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,1],[2,3,4],[3,4],[4]]
 => [[1,1,1,1,2,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,2],[2,3,4],[3,4],[4]]
 => [[1,1,1,2,2,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,3],[2,3,4],[3,4],[4]]
 => [[1,1,1,2,3,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,1,4],[2,3,4],[3,4],[4]]
 => [[1,1,1,2,3,4,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,2,2],[2,3,4],[3,4],[4]]
 => [[1,1,2,2,2,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,2,3],[2,3,4],[3,4],[4]]
 => [[1,1,2,2,3,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,2,4],[2,3,4],[3,4],[4]]
 => [[1,1,2,2,3,4,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,3,3],[2,3,4],[3,4],[4]]
 => [[1,1,2,3,3,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,1,3,4],[2,3,4],[3,4],[4]]
 => [[1,1,2,3,3,4,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,2,2,2],[2,3,3],[3,4],[4]]
 => [[1,2,2,2,2,3,3],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,2,2,3],[2,3,3],[3,4],[4]]
 => [[1,2,2,2,3,3,3],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,2,2,2],[2,3,4],[3,4],[4]]
 => [[1,2,2,2,2,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,2,2,3],[2,3,4],[3,4],[4]]
 => [[1,2,2,2,3,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,2,2,4],[2,3,4],[3,4],[4]]
 => [[1,2,2,2,3,4,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,2,3,3],[2,3,4],[3,4],[4]]
 => [[1,2,2,3,3,3,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
[[1,2,3,4],[2,3,4],[3,4],[4]]
 => [[1,2,2,3,3,4,4],[3,4],[4]]
 => [7,2,1]
 => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
 => ? = 1 - 1
Description
The number of rises of length 2 of a Dyck path. This is also the number of $(1,1)$ steps of the associated Łukasiewicz path, see [1]. A related statistic is the number of double rises in a Dyck path, [[St000024]].
The following 195 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000905The number of different multiplicities of parts of an integer composition. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001330The hat guessing number of a graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000116The major index of a semistandard tableau obtained by standardizing. St001569The maximal modular displacement of a permutation. St001684The reduced word complexity of a permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St001895The oddness of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St000068The number of minimal elements in a poset. St001429The number of negative entries in a signed permutation. St001866The nesting alignments of a signed permutation. St000753The Grundy value for the game of Kayles on a binary word. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001520The number of strict 3-descents. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001864The number of excedances of a signed permutation. St000682The Grundy value of Welter's game on a binary word. St001171The vector space dimension of $Ext_A^1(I_o,A)$ when $I_o$ is the tilting module corresponding to the permutation $o$ in the Auslander algebra $A$ of $K[x]/(x^n)$. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001861The number of Bruhat lower covers of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St001862The number of crossings of a signed permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001892The flag excedance statistic of a signed permutation. St001894The depth of a signed permutation. St000519The largest length of a factor maximising the subword complexity. St000922The minimal number such that all substrings of this length are unique. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001838The number of nonempty primitive factors of a binary word. St001805The maximal overlap of a cylindrical tableau associated with a semistandard tableau. St000633The size of the automorphism group of a poset. St000908The length of the shortest maximal antichain in a poset. St000914The sum of the values of the Möbius function of a poset. St001399The distinguishing number of a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St000850The number of 1/2-balanced pairs in a poset. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St001472The permanent of the Coxeter matrix of the poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001618The cardinality of the Frattini sublattice of a lattice. St001616The number of neutral elements in a lattice. St001720The minimal length of a chain of small intervals in a lattice. St000454The largest eigenvalue of a graph if it is integral. St001613The binary logarithm of the size of the center of a lattice. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St000422The energy of a graph, if it is integral. St001820The size of the image of the pop stack sorting operator. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001846The number of elements which do not have a complement in the lattice. St001863The number of weak excedances of a signed permutation. St001896The number of right descents of a signed permutations. St001772The number of occurrences of the signed pattern 12 in a signed permutation. St001867The number of alignments of type EN of a signed permutation. St001889The size of the connectivity set of a signed permutation. St001817The number of flag weak exceedances of a signed permutation. St001822The number of alignments of a signed permutation. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001860The number of factors of the Stanley symmetric function associated with a signed permutation. St001904The length of the initial strictly increasing segment of a parking function. St001937The size of the center of a parking function. St000135The number of lucky cars of the parking function. St000188The area of the Dyck path corresponding to a parking function and the total displacement of a parking function. St000195The number of secondary dinversion pairs of the dyck path corresponding to a parking function. St000943The number of spots the most unlucky car had to go further in a parking function. St001927Sparre Andersen's number of positives of a signed permutation. St000540The sum of the entries of a parking function minus its length. St000165The sum of the entries of a parking function. St001852The size of the conjugacy class of the signed permutation. St001168The vector space dimension of the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St000298The order dimension or Dushnik-Miller dimension of a poset. St000632The jump number of the poset. St000640The rank of the largest boolean interval in a poset. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000907The number of maximal antichains of minimal length in a poset. St000942The number of critical left to right maxima of the parking functions. St001423The number of distinct cubes in a binary word. St001433The flag major index of a signed permutation. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001768The number of reduced words of a signed permutation. St001769The reflection length of a signed permutation. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001819The flag Denert index of a signed permutation. St001821The sorting index of a signed permutation. St001823The Stasinski-Voll length of a signed permutation. St001893The flag descent of a signed permutation. St001905The number of preferred parking spots in a parking function less than the index of the car. St001935The number of ascents in a parking function. St001946The number of descents in a parking function. St000080The rank of the poset. St000136The dinv of a parking function. St000194The number of primary dinversion pairs of a labelled dyck path corresponding to a parking function. St000526The number of posets with combinatorially isomorphic order polytopes. St000717The number of ordinal summands of a poset. St000911The number of maximal antichains of maximal size in a poset. St001095The number of non-isomorphic posets with precisely one further covering relation. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001209The pmaj statistic of a parking function. St001404The number of distinct entries in a Gelfand Tsetlin pattern. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001557The number of inversions of the second entry of a permutation. St001635The trace of the square of the Coxeter matrix of the incidence algebra of a poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001686The order of promotion on a Gelfand-Tsetlin pattern. St001770The number of facets of a certain subword complex associated with the signed permutation. St001857The number of edges in the reduced word graph of a signed permutation. St001884The number of borders of a binary word. St001903The number of fixed points of a parking function. St001926Sparre Andersen's position of the maximum of a signed permutation. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000186The sum of the first row in a Gelfand-Tsetlin pattern. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000295The length of the border of a binary word. St000528The height of a poset. St000744The length of the path to the largest entry in a standard Young tableau. St000906The length of the shortest maximal chain in a poset. St001371The length of the longest Yamanouchi prefix of a binary word. St001398Number of subsets of size 3 of elements in a poset that form a "v". St001510The number of self-evacuating linear extensions of a finite poset. St001534The alternating sum of the coefficients of the Poincare polynomial of the poset cone. St001730The number of times the path corresponding to a binary word crosses the base line. St001851The number of Hecke atoms of a signed permutation. St000044The number of vertices of the unicellular map given by a perfect matching. St000643The size of the largest orbit of antichains under Panyushev complementation. St000680The Grundy value for Hackendot on posets. St000909The number of maximal chains of maximal size in a poset. St000910The number of maximal chains of minimal length in a poset. St000912The number of maximal antichains in a poset. St001268The size of the largest ordinal summand in the poset. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001397Number of pairs of incomparable elements in a finite poset. St001718The number of non-empty open intervals in a poset. St001854The size of the left Kazhdan-Lusztig cell, St000017The number of inversions of a standard tableau. St000072The number of circled entries. St000073The number of boxed entries. St000077The number of boxed and circled entries. St000189The number of elements in the poset. St001343The dimension of the reduced incidence algebra of a poset. St001434The number of negative sum pairs of a signed permutation. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001717The largest size of an interval in a poset. St001902The number of potential covers of a poset. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001721The degree of a binary word. St000524The number of posets with the same order polynomial. St000525The number of posets with the same zeta polynomial. St000543The size of the conjugacy class of a binary word. St000626The minimal period of a binary word. St000656The number of cuts of a poset. St001848The atomic length of a signed permutation. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001406The number of nonzero entries in a Gelfand Tsetlin pattern. St001782The order of rowmotion on the set of order ideals of a poset. St001858The number of covering elements of a signed permutation in absolute order. St001865The number of alignments of a signed permutation. St001855The number of signed permutations less than or equal to a signed permutation in left weak order. St000070The number of antichains in a poset. St001779The order of promotion on the set of linear extensions of a poset. St000016The number of attacking pairs of a standard tableau. St000641The number of non-empty boolean intervals in a poset. St000639The number of relations in a poset. St000958The number of Bruhat factorizations of a permutation. St001853The size of the two-sided Kazhdan-Lusztig cell, St001664The number of non-isomorphic subposets of a poset. St001885The number of binary words with the same proper border set. St001709The number of homomorphisms to the three element chain of a poset. St001815The number of order preserving surjections from a poset to a total order. St001813The product of the sizes of the principal order filters in a poset. St001828The Euler characteristic of a graph. St001964The interval resolution global dimension of a poset. St000181The number of connected components of the Hasse diagram for the poset. St000635The number of strictly order preserving maps of a poset into itself. St001890The maximum magnitude of the Möbius function of a poset. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.