- FindStat

Your data matches 210 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)

Matching statistic: St000126
(load all 16 compositions to match this statistic)

Mapping

St000126: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[.,.]
 => 0 = 1 - 1
[.,[.,.]]
 => 0 = 1 - 1
[[.,.],.]
 => 0 = 1 - 1
[.,[.,[.,.]]]
 => 0 = 1 - 1
[.,[[.,.],.]]
 => 0 = 1 - 1
[[.,.],[.,.]]
 => 0 = 1 - 1
[[.,[.,.]],.]
 => 0 = 1 - 1
[[[.,.],.],.]
 => 0 = 1 - 1
[.,[.,[.,[.,.]]]]
 => 0 = 1 - 1
[.,[.,[[.,.],.]]]
 => 0 = 1 - 1
[.,[[.,.],[.,.]]]
 => 0 = 1 - 1
[.,[[.,[.,.]],.]]
 => 0 = 1 - 1
[.,[[[.,.],.],.]]
 => 0 = 1 - 1
[[.,.],[.,[.,.]]]
 => 0 = 1 - 1
[[.,.],[[.,.],.]]
 => 0 = 1 - 1
[[.,[.,.]],[.,.]]
 => 0 = 1 - 1
[[[.,.],.],[.,.]]
 => 0 = 1 - 1
[[.,[.,[.,.]]],.]
 => 0 = 1 - 1
[[.,[[.,.],.]],.]
 => 0 = 1 - 1
[[[.,.],[.,.]],.]
 => 0 = 1 - 1
[[[.,[.,.]],.],.]
 => 0 = 1 - 1
[[[[.,.],.],.],.]
 => 0 = 1 - 1
[.,[.,[.,[.,[.,.]]]]]
 => 1 = 2 - 1
[.,[.,[.,[[.,.],.]]]]
 => 0 = 1 - 1
[.,[.,[[.,.],[.,.]]]]
 => 0 = 1 - 1
[.,[.,[[.,[.,.]],.]]]
 => 0 = 1 - 1
[.,[.,[[[.,.],.],.]]]
 => 0 = 1 - 1
[.,[[.,.],[.,[.,.]]]]
 => 0 = 1 - 1
[.,[[.,.],[[.,.],.]]]
 => 0 = 1 - 1
[.,[[.,[.,.]],[.,.]]]
 => 0 = 1 - 1
[.,[[[.,.],.],[.,.]]]
 => 0 = 1 - 1
[.,[[.,[.,[.,.]]],.]]
 => 0 = 1 - 1
[.,[[.,[[.,.],.]],.]]
 => 0 = 1 - 1
[.,[[[.,.],[.,.]],.]]
 => 0 = 1 - 1
[.,[[[.,[.,.]],.],.]]
 => 0 = 1 - 1
[.,[[[[.,.],.],.],.]]
 => 0 = 1 - 1
[[.,.],[.,[.,[.,.]]]]
 => 0 = 1 - 1
[[.,.],[.,[[.,.],.]]]
 => 0 = 1 - 1
[[.,.],[[.,.],[.,.]]]
 => 0 = 1 - 1
[[.,.],[[.,[.,.]],.]]
 => 0 = 1 - 1
[[.,.],[[[.,.],.],.]]
 => 0 = 1 - 1
[[.,[.,.]],[.,[.,.]]]
 => 0 = 1 - 1
[[.,[.,.]],[[.,.],.]]
 => 0 = 1 - 1
[[[.,.],.],[.,[.,.]]]
 => 0 = 1 - 1
[[[.,.],.],[[.,.],.]]
 => 0 = 1 - 1
[[.,[.,[.,.]]],[.,.]]
 => 0 = 1 - 1
[[.,[[.,.],.]],[.,.]]
 => 0 = 1 - 1
[[[.,.],[.,.]],[.,.]]
 => 0 = 1 - 1
[[[.,[.,.]],.],[.,.]]
 => 0 = 1 - 1
[[[[.,.],.],.],[.,.]]
 => 0 = 1 - 1

Description

The number of occurrences of the contiguous pattern {{{[.,[.,[.,[.,[.,.]]]]]}}} in a binary tree. [[oeis:A036766]] counts binary trees avoiding this pattern.

Matching statistic: St001256
(load all 11 compositions to match this statistic)

Mapping

Mp00017: Binary trees —to 312-avoiding permutation⟶ Permutations
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001256: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[.,.]
 => [1] => [1] => [1,0]
 => 1
[.,[.,.]]
 => [2,1] => [1,1] => [1,0,1,0]
 => 1
[[.,.],.]
 => [1,2] => [2] => [1,1,0,0]
 => 1
[.,[.,[.,.]]]
 => [3,2,1] => [1,1,1] => [1,0,1,0,1,0]
 => 1
[.,[[.,.],.]]
 => [2,3,1] => [2,1] => [1,1,0,0,1,0]
 => 1
[[.,.],[.,.]]
 => [1,3,2] => [2,1] => [1,1,0,0,1,0]
 => 1
[[.,[.,.]],.]
 => [2,1,3] => [1,2] => [1,0,1,1,0,0]
 => 1
[[[.,.],.],.]
 => [1,2,3] => [3] => [1,1,1,0,0,0]
 => 1
[.,[.,[.,[.,.]]]]
 => [4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 1
[.,[.,[[.,.],.]]]
 => [3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 1
[.,[[.,.],[.,.]]]
 => [2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 1
[.,[[.,[.,.]],.]]
 => [3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 1
[.,[[[.,.],.],.]]
 => [2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[[.,.],[.,[.,.]]]
 => [1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 1
[[.,.],[[.,.],.]]
 => [1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[[.,[.,.]],[.,.]]
 => [2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 1
[[[.,.],.],[.,.]]
 => [1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[[.,[.,[.,.]]],.]
 => [3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 1
[[.,[[.,.],.]],.]
 => [2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
[[[.,.],[.,.]],.]
 => [1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
[[[.,[.,.]],.],.]
 => [2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
 => 1
[[[[.,.],.],.],.]
 => [1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => [5,4,3,2,1] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 2
[.,[.,[.,[[.,.],.]]]]
 => [4,5,3,2,1] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 1
[.,[.,[[.,.],[.,.]]]]
 => [3,5,4,2,1] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 1
[.,[.,[[.,[.,.]],.]]]
 => [4,3,5,2,1] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[.,[.,[[[.,.],.],.]]]
 => [3,4,5,2,1] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 1
[.,[[.,.],[.,[.,.]]]]
 => [2,5,4,3,1] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 1
[.,[[.,.],[[.,.],.]]]
 => [2,4,5,3,1] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 1
[.,[[.,[.,.]],[.,.]]]
 => [3,2,5,4,1] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[.,[[[.,.],.],[.,.]]]
 => [2,3,5,4,1] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 1
[.,[[.,[.,[.,.]]],.]]
 => [4,3,2,5,1] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 1
[.,[[.,[[.,.],.]],.]]
 => [3,4,2,5,1] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 1
[.,[[[.,.],[.,.]],.]]
 => [2,4,3,5,1] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 1
[.,[[[.,[.,.]],.],.]]
 => [3,2,4,5,1] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 1
[.,[[[[.,.],.],.],.]]
 => [2,3,4,5,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 1
[[.,.],[.,[.,[.,.]]]]
 => [1,5,4,3,2] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 1
[[.,.],[.,[[.,.],.]]]
 => [1,4,5,3,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 1
[[.,.],[[.,.],[.,.]]]
 => [1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 1
[[.,.],[[.,[.,.]],.]]
 => [1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 1
[[.,.],[[[.,.],.],.]]
 => [1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 1
[[.,[.,.]],[.,[.,.]]]
 => [2,1,5,4,3] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[[.,[.,.]],[[.,.],.]]
 => [2,1,4,5,3] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 1
[[[.,.],.],[.,[.,.]]]
 => [1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 1
[[[.,.],.],[[.,.],.]]
 => [1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 1
[[.,[.,[.,.]]],[.,.]]
 => [3,2,1,5,4] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 1
[[.,[[.,.],.]],[.,.]]
 => [2,3,1,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 1
[[[.,.],[.,.]],[.,.]]
 => [1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 1
[[[.,[.,.]],.],[.,.]]
 => [2,1,3,5,4] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 1
[[[[.,.],.],.],[.,.]]
 => [1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 1

Description

Number of simple reflexive modules that are 2-stable reflexive. See Definition 3.1. in the reference for the definition of 2-stable reflexive.

Matching statistic: St001537

Mapping

Mp00017: Binary trees —to 312-avoiding permutation⟶ Permutations
Mp00254: Permutations —Inverse fireworks map⟶ Permutations
Mp00087: Permutations —inverse first fundamental transformation⟶ Permutations
St001537: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[.,.]
 => [1] => [1] => [1] => 0 = 1 - 1
[.,[.,.]]
 => [2,1] => [2,1] => [2,1] => 0 = 1 - 1
[[.,.],.]
 => [1,2] => [1,2] => [1,2] => 0 = 1 - 1
[.,[.,[.,.]]]
 => [3,2,1] => [3,2,1] => [2,3,1] => 0 = 1 - 1
[.,[[.,.],.]]
 => [2,3,1] => [1,3,2] => [1,3,2] => 0 = 1 - 1
[[.,.],[.,.]]
 => [1,3,2] => [1,3,2] => [1,3,2] => 0 = 1 - 1
[[.,[.,.]],.]
 => [2,1,3] => [2,1,3] => [2,1,3] => 0 = 1 - 1
[[[.,.],.],.]
 => [1,2,3] => [1,2,3] => [1,2,3] => 0 = 1 - 1
[.,[.,[.,[.,.]]]]
 => [4,3,2,1] => [4,3,2,1] => [3,2,4,1] => 0 = 1 - 1
[.,[.,[[.,.],.]]]
 => [3,4,2,1] => [1,4,3,2] => [1,3,4,2] => 0 = 1 - 1
[.,[[.,.],[.,.]]]
 => [2,4,3,1] => [1,4,3,2] => [1,3,4,2] => 0 = 1 - 1
[.,[[.,[.,.]],.]]
 => [3,2,4,1] => [2,1,4,3] => [2,1,4,3] => 0 = 1 - 1
[.,[[[.,.],.],.]]
 => [2,3,4,1] => [1,2,4,3] => [1,2,4,3] => 0 = 1 - 1
[[.,.],[.,[.,.]]]
 => [1,4,3,2] => [1,4,3,2] => [1,3,4,2] => 0 = 1 - 1
[[.,.],[[.,.],.]]
 => [1,3,4,2] => [1,2,4,3] => [1,2,4,3] => 0 = 1 - 1
[[.,[.,.]],[.,.]]
 => [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 0 = 1 - 1
[[[.,.],.],[.,.]]
 => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 0 = 1 - 1
[[.,[.,[.,.]]],.]
 => [3,2,1,4] => [3,2,1,4] => [2,3,1,4] => 0 = 1 - 1
[[.,[[.,.],.]],.]
 => [2,3,1,4] => [1,3,2,4] => [1,3,2,4] => 0 = 1 - 1
[[[.,.],[.,.]],.]
 => [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 0 = 1 - 1
[[[.,[.,.]],.],.]
 => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 0 = 1 - 1
[[[[.,.],.],.],.]
 => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0 = 1 - 1
[.,[.,[.,[.,[.,.]]]]]
 => [5,4,3,2,1] => [5,4,3,2,1] => [3,4,2,5,1] => 1 = 2 - 1
[.,[.,[.,[[.,.],.]]]]
 => [4,5,3,2,1] => [1,5,4,3,2] => [1,4,3,5,2] => 0 = 1 - 1
[.,[.,[[.,.],[.,.]]]]
 => [3,5,4,2,1] => [1,5,4,3,2] => [1,4,3,5,2] => 0 = 1 - 1
[.,[.,[[.,[.,.]],.]]]
 => [4,3,5,2,1] => [2,1,5,4,3] => [2,1,4,5,3] => 0 = 1 - 1
[.,[.,[[[.,.],.],.]]]
 => [3,4,5,2,1] => [1,2,5,4,3] => [1,2,4,5,3] => 0 = 1 - 1
[.,[[.,.],[.,[.,.]]]]
 => [2,5,4,3,1] => [1,5,4,3,2] => [1,4,3,5,2] => 0 = 1 - 1
[.,[[.,.],[[.,.],.]]]
 => [2,4,5,3,1] => [1,2,5,4,3] => [1,2,4,5,3] => 0 = 1 - 1
[.,[[.,[.,.]],[.,.]]]
 => [3,2,5,4,1] => [2,1,5,4,3] => [2,1,4,5,3] => 0 = 1 - 1
[.,[[[.,.],.],[.,.]]]
 => [2,3,5,4,1] => [1,2,5,4,3] => [1,2,4,5,3] => 0 = 1 - 1
[.,[[.,[.,[.,.]]],.]]
 => [4,3,2,5,1] => [3,2,1,5,4] => [2,3,1,5,4] => 0 = 1 - 1
[.,[[.,[[.,.],.]],.]]
 => [3,4,2,5,1] => [1,3,2,5,4] => [1,3,2,5,4] => 0 = 1 - 1
[.,[[[.,.],[.,.]],.]]
 => [2,4,3,5,1] => [1,3,2,5,4] => [1,3,2,5,4] => 0 = 1 - 1
[.,[[[.,[.,.]],.],.]]
 => [3,2,4,5,1] => [2,1,3,5,4] => [2,1,3,5,4] => 0 = 1 - 1
[.,[[[[.,.],.],.],.]]
 => [2,3,4,5,1] => [1,2,3,5,4] => [1,2,3,5,4] => 0 = 1 - 1
[[.,.],[.,[.,[.,.]]]]
 => [1,5,4,3,2] => [1,5,4,3,2] => [1,4,3,5,2] => 0 = 1 - 1
[[.,.],[.,[[.,.],.]]]
 => [1,4,5,3,2] => [1,2,5,4,3] => [1,2,4,5,3] => 0 = 1 - 1
[[.,.],[[.,.],[.,.]]]
 => [1,3,5,4,2] => [1,2,5,4,3] => [1,2,4,5,3] => 0 = 1 - 1
[[.,.],[[.,[.,.]],.]]
 => [1,4,3,5,2] => [1,3,2,5,4] => [1,3,2,5,4] => 0 = 1 - 1
[[.,.],[[[.,.],.],.]]
 => [1,3,4,5,2] => [1,2,3,5,4] => [1,2,3,5,4] => 0 = 1 - 1
[[.,[.,.]],[.,[.,.]]]
 => [2,1,5,4,3] => [2,1,5,4,3] => [2,1,4,5,3] => 0 = 1 - 1
[[.,[.,.]],[[.,.],.]]
 => [2,1,4,5,3] => [2,1,3,5,4] => [2,1,3,5,4] => 0 = 1 - 1
[[[.,.],.],[.,[.,.]]]
 => [1,2,5,4,3] => [1,2,5,4,3] => [1,2,4,5,3] => 0 = 1 - 1
[[[.,.],.],[[.,.],.]]
 => [1,2,4,5,3] => [1,2,3,5,4] => [1,2,3,5,4] => 0 = 1 - 1
[[.,[.,[.,.]]],[.,.]]
 => [3,2,1,5,4] => [3,2,1,5,4] => [2,3,1,5,4] => 0 = 1 - 1
[[.,[[.,.],.]],[.,.]]
 => [2,3,1,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 0 = 1 - 1
[[[.,.],[.,.]],[.,.]]
 => [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 0 = 1 - 1
[[[.,[.,.]],.],[.,.]]
 => [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => 0 = 1 - 1
[[[[.,.],.],.],[.,.]]
 => [1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => 0 = 1 - 1

Description

The number of cyclic crossings of a permutation. The pair

$(i,j)$ is a cyclic crossing of a permutation

$\pi$ if

$i, \pi(j), \pi(i), j$ are cyclically ordered and all distinct, see Section 5 of [1].

Matching statistic: St000284

Mapping

Mp00014: Binary trees —to 132-avoiding permutation⟶ Permutations
Mp00204: Permutations —LLPS⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000284: Integer partitions ⟶ ℤResult quality: 33% ●values known / values provided: 79%●distinct values known / distinct values provided: 33%

Values

[.,.]
 => [1] => [1]
 => []
 => ? = 1
[.,[.,.]]
 => [2,1] => [2]
 => []
 => ? = 1
[[.,.],.]
 => [1,2] => [1,1]
 => [1]
 => ? = 1
[.,[.,[.,.]]]
 => [3,2,1] => [3]
 => []
 => ? = 1
[.,[[.,.],.]]
 => [2,3,1] => [2,1]
 => [1]
 => ? = 1
[[.,.],[.,.]]
 => [3,1,2] => [2,1]
 => [1]
 => ? = 1
[[.,[.,.]],.]
 => [2,1,3] => [2,1]
 => [1]
 => ? = 1
[[[.,.],.],.]
 => [1,2,3] => [1,1,1]
 => [1,1]
 => 1
[.,[.,[.,[.,.]]]]
 => [4,3,2,1] => [4]
 => []
 => ? = 1
[.,[.,[[.,.],.]]]
 => [3,4,2,1] => [3,1]
 => [1]
 => ? = 1
[.,[[.,.],[.,.]]]
 => [4,2,3,1] => [3,1]
 => [1]
 => ? = 1
[.,[[.,[.,.]],.]]
 => [3,2,4,1] => [3,1]
 => [1]
 => ? = 1
[.,[[[.,.],.],.]]
 => [2,3,4,1] => [2,1,1]
 => [1,1]
 => 1
[[.,.],[.,[.,.]]]
 => [4,3,1,2] => [3,1]
 => [1]
 => ? = 1
[[.,.],[[.,.],.]]
 => [3,4,1,2] => [2,1,1]
 => [1,1]
 => 1
[[.,[.,.]],[.,.]]
 => [4,2,1,3] => [3,1]
 => [1]
 => ? = 1
[[[.,.],.],[.,.]]
 => [4,1,2,3] => [2,1,1]
 => [1,1]
 => 1
[[.,[.,[.,.]]],.]
 => [3,2,1,4] => [3,1]
 => [1]
 => ? = 1
[[.,[[.,.],.]],.]
 => [2,3,1,4] => [2,1,1]
 => [1,1]
 => 1
[[[.,.],[.,.]],.]
 => [3,1,2,4] => [2,1,1]
 => [1,1]
 => 1
[[[.,[.,.]],.],.]
 => [2,1,3,4] => [2,1,1]
 => [1,1]
 => 1
[[[[.,.],.],.],.]
 => [1,2,3,4] => [1,1,1,1]
 => [1,1,1]
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => [5,4,3,2,1] => [5]
 => []
 => ? = 2
[.,[.,[.,[[.,.],.]]]]
 => [4,5,3,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[.,.],[.,.]]]]
 => [5,3,4,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[.,[.,.]],.]]]
 => [4,3,5,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[[.,.],.],.]]]
 => [3,4,5,2,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,.],[.,[.,.]]]]
 => [5,4,2,3,1] => [4,1]
 => [1]
 => ? = 1
[.,[[.,.],[[.,.],.]]]
 => [4,5,2,3,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,[.,.]],[.,.]]]
 => [5,3,2,4,1] => [4,1]
 => [1]
 => ? = 1
[.,[[[.,.],.],[.,.]]]
 => [5,2,3,4,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,[.,[.,.]]],.]]
 => [4,3,2,5,1] => [4,1]
 => [1]
 => ? = 1
[.,[[.,[[.,.],.]],.]]
 => [3,4,2,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[.,.],[.,.]],.]]
 => [4,2,3,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[.,[.,.]],.],.]]
 => [3,2,4,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[[.,.],.],.],.]]
 => [2,3,4,5,1] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,.],[.,[.,[.,.]]]]
 => [5,4,3,1,2] => [4,1]
 => [1]
 => ? = 1
[[.,.],[.,[[.,.],.]]]
 => [4,5,3,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[.,.],[.,.]]]
 => [5,3,4,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[.,[.,.]],.]]
 => [4,3,5,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[[.,.],.],.]]
 => [3,4,5,1,2] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,.]],[.,[.,.]]]
 => [5,4,2,1,3] => [4,1]
 => [1]
 => ? = 1
[[.,[.,.]],[[.,.],.]]
 => [4,5,2,1,3] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],.],[.,[.,.]]]
 => [5,4,1,2,3] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],.],[[.,.],.]]
 => [4,5,1,2,3] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,[.,.]]],[.,.]]
 => [5,3,2,1,4] => [4,1]
 => [1]
 => ? = 1
[[.,[[.,.],.]],[.,.]]
 => [5,2,3,1,4] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],[.,.]],[.,.]]
 => [5,3,1,2,4] => [3,1,1]
 => [1,1]
 => 1
[[[.,[.,.]],.],[.,.]]
 => [5,2,1,3,4] => [3,1,1]
 => [1,1]
 => 1
[[[[.,.],.],.],[.,.]]
 => [5,1,2,3,4] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,[.,[.,.]]]],.]
 => [4,3,2,1,5] => [4,1]
 => [1]
 => ? = 1
[[.,[.,[[.,.],.]]],.]
 => [3,4,2,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[.,.],[.,.]]],.]
 => [4,2,3,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[.,[.,.]],.]],.]
 => [3,2,4,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[[.,.],.],.]],.]
 => [2,3,4,1,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,.],[.,[.,.]]],.]
 => [4,3,1,2,5] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],[[.,.],.]],.]
 => [3,4,1,2,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,[.,.]],[.,.]],.]
 => [4,2,1,3,5] => [3,1,1]
 => [1,1]
 => 1
[[[[.,.],.],[.,.]],.]
 => [4,1,2,3,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,[.,[.,.]]],.],.]
 => [3,2,1,4,5] => [3,1,1]
 => [1,1]
 => 1
[[[.,[[.,.],.]],.],.]
 => [2,3,1,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[.,.],[.,.]],.],.]
 => [3,1,2,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[.,[.,.]],.],.],.]
 => [2,1,3,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[[.,.],.],.],.],.]
 => [1,2,3,4,5] => [1,1,1,1,1]
 => [1,1,1,1]
 => 1
[.,[.,[.,[.,[.,[.,.]]]]]]
 => [6,5,4,3,2,1] => [6]
 => []
 => ? = 3
[.,[.,[.,[.,[[.,.],.]]]]]
 => [5,6,4,3,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[.,[[.,.],[.,.]]]]]
 => [6,4,5,3,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[.,[[.,[.,.]],.]]]]
 => [5,4,6,3,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[.,[[[.,.],.],.]]]]
 => [4,5,6,3,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,.],[.,[.,.]]]]]
 => [6,5,3,4,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[[.,.],[[.,.],.]]]]
 => [5,6,3,4,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,[.,.]],[.,.]]]]
 => [6,4,3,5,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[[[.,.],.],[.,.]]]]
 => [6,3,4,5,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,[.,[.,.]]],.]]]
 => [5,4,3,6,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[[.,[[.,.],.]],.]]]
 => [4,5,3,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[.,.],[.,.]],.]]]
 => [5,3,4,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[.,[.,.]],.],.]]]
 => [4,3,5,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[[.,.],.],.],.]]]
 => [3,4,5,6,2,1] => [3,1,1,1]
 => [1,1,1]
 => 1
[.,[[.,.],[.,[.,[.,.]]]]]
 => [6,5,4,2,3,1] => [5,1]
 => [1]
 => ? = 2
[.,[[.,.],[.,[[.,.],.]]]]
 => [5,6,4,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[.,.],[.,.]]]]
 => [6,4,5,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[.,[.,.]],.]]]
 => [5,4,6,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[[.,.],.],.]]]
 => [4,5,6,2,3,1] => [3,1,1,1]
 => [1,1,1]
 => 1
[.,[[.,[.,.]],[.,[.,.]]]]
 => [6,5,3,2,4,1] => [5,1]
 => [1]
 => ? = 1
[.,[[.,[.,[.,.]]],[.,.]]]
 => [6,4,3,2,5,1] => [5,1]
 => [1]
 => ? = 1
[.,[[.,[.,[.,[.,.]]]],.]]
 => [5,4,3,2,6,1] => [5,1]
 => [1]
 => ? = 1
[[.,.],[.,[.,[.,[.,.]]]]]
 => [6,5,4,3,1,2] => [5,1]
 => [1]
 => ? = 2
[[.,[.,.]],[.,[.,[.,.]]]]
 => [6,5,4,2,1,3] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,.]]],[.,[.,.]]]
 => [6,5,3,2,1,4] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,[.,.]]]],[.,.]]
 => [6,4,3,2,1,5] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,[.,[.,.]]]]],.]
 => [5,4,3,2,1,6] => [5,1]
 => [1]
 => ? = 2

Description

The Plancherel distribution on integer partitions. This is defined as the distribution induced by the RSK shape of the uniform distribution on permutations. In other words, this is the size of the preimage of the map 'Robinson-Schensted tableau shape' from permutations to integer partitions. Equivalently, this is given by the square of the number of standard Young tableaux of the given shape.

Matching statistic: St000620

Mapping

Mp00014: Binary trees —to 132-avoiding permutation⟶ Permutations
Mp00204: Permutations —LLPS⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000620: Integer partitions ⟶ ℤResult quality: 33% ●values known / values provided: 79%●distinct values known / distinct values provided: 33%

Values

[.,.]
 => [1] => [1]
 => []
 => ? = 1
[.,[.,.]]
 => [2,1] => [2]
 => []
 => ? = 1
[[.,.],.]
 => [1,2] => [1,1]
 => [1]
 => ? = 1
[.,[.,[.,.]]]
 => [3,2,1] => [3]
 => []
 => ? = 1
[.,[[.,.],.]]
 => [2,3,1] => [2,1]
 => [1]
 => ? = 1
[[.,.],[.,.]]
 => [3,1,2] => [2,1]
 => [1]
 => ? = 1
[[.,[.,.]],.]
 => [2,1,3] => [2,1]
 => [1]
 => ? = 1
[[[.,.],.],.]
 => [1,2,3] => [1,1,1]
 => [1,1]
 => 1
[.,[.,[.,[.,.]]]]
 => [4,3,2,1] => [4]
 => []
 => ? = 1
[.,[.,[[.,.],.]]]
 => [3,4,2,1] => [3,1]
 => [1]
 => ? = 1
[.,[[.,.],[.,.]]]
 => [4,2,3,1] => [3,1]
 => [1]
 => ? = 1
[.,[[.,[.,.]],.]]
 => [3,2,4,1] => [3,1]
 => [1]
 => ? = 1
[.,[[[.,.],.],.]]
 => [2,3,4,1] => [2,1,1]
 => [1,1]
 => 1
[[.,.],[.,[.,.]]]
 => [4,3,1,2] => [3,1]
 => [1]
 => ? = 1
[[.,.],[[.,.],.]]
 => [3,4,1,2] => [2,1,1]
 => [1,1]
 => 1
[[.,[.,.]],[.,.]]
 => [4,2,1,3] => [3,1]
 => [1]
 => ? = 1
[[[.,.],.],[.,.]]
 => [4,1,2,3] => [2,1,1]
 => [1,1]
 => 1
[[.,[.,[.,.]]],.]
 => [3,2,1,4] => [3,1]
 => [1]
 => ? = 1
[[.,[[.,.],.]],.]
 => [2,3,1,4] => [2,1,1]
 => [1,1]
 => 1
[[[.,.],[.,.]],.]
 => [3,1,2,4] => [2,1,1]
 => [1,1]
 => 1
[[[.,[.,.]],.],.]
 => [2,1,3,4] => [2,1,1]
 => [1,1]
 => 1
[[[[.,.],.],.],.]
 => [1,2,3,4] => [1,1,1,1]
 => [1,1,1]
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => [5,4,3,2,1] => [5]
 => []
 => ? = 2
[.,[.,[.,[[.,.],.]]]]
 => [4,5,3,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[.,.],[.,.]]]]
 => [5,3,4,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[.,[.,.]],.]]]
 => [4,3,5,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[[.,.],.],.]]]
 => [3,4,5,2,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,.],[.,[.,.]]]]
 => [5,4,2,3,1] => [4,1]
 => [1]
 => ? = 1
[.,[[.,.],[[.,.],.]]]
 => [4,5,2,3,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,[.,.]],[.,.]]]
 => [5,3,2,4,1] => [4,1]
 => [1]
 => ? = 1
[.,[[[.,.],.],[.,.]]]
 => [5,2,3,4,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,[.,[.,.]]],.]]
 => [4,3,2,5,1] => [4,1]
 => [1]
 => ? = 1
[.,[[.,[[.,.],.]],.]]
 => [3,4,2,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[.,.],[.,.]],.]]
 => [4,2,3,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[.,[.,.]],.],.]]
 => [3,2,4,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[[.,.],.],.],.]]
 => [2,3,4,5,1] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,.],[.,[.,[.,.]]]]
 => [5,4,3,1,2] => [4,1]
 => [1]
 => ? = 1
[[.,.],[.,[[.,.],.]]]
 => [4,5,3,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[.,.],[.,.]]]
 => [5,3,4,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[.,[.,.]],.]]
 => [4,3,5,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[[.,.],.],.]]
 => [3,4,5,1,2] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,.]],[.,[.,.]]]
 => [5,4,2,1,3] => [4,1]
 => [1]
 => ? = 1
[[.,[.,.]],[[.,.],.]]
 => [4,5,2,1,3] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],.],[.,[.,.]]]
 => [5,4,1,2,3] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],.],[[.,.],.]]
 => [4,5,1,2,3] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,[.,.]]],[.,.]]
 => [5,3,2,1,4] => [4,1]
 => [1]
 => ? = 1
[[.,[[.,.],.]],[.,.]]
 => [5,2,3,1,4] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],[.,.]],[.,.]]
 => [5,3,1,2,4] => [3,1,1]
 => [1,1]
 => 1
[[[.,[.,.]],.],[.,.]]
 => [5,2,1,3,4] => [3,1,1]
 => [1,1]
 => 1
[[[[.,.],.],.],[.,.]]
 => [5,1,2,3,4] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,[.,[.,.]]]],.]
 => [4,3,2,1,5] => [4,1]
 => [1]
 => ? = 1
[[.,[.,[[.,.],.]]],.]
 => [3,4,2,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[.,.],[.,.]]],.]
 => [4,2,3,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[.,[.,.]],.]],.]
 => [3,2,4,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[[.,.],.],.]],.]
 => [2,3,4,1,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,.],[.,[.,.]]],.]
 => [4,3,1,2,5] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],[[.,.],.]],.]
 => [3,4,1,2,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,[.,.]],[.,.]],.]
 => [4,2,1,3,5] => [3,1,1]
 => [1,1]
 => 1
[[[[.,.],.],[.,.]],.]
 => [4,1,2,3,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,[.,[.,.]]],.],.]
 => [3,2,1,4,5] => [3,1,1]
 => [1,1]
 => 1
[[[.,[[.,.],.]],.],.]
 => [2,3,1,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[.,.],[.,.]],.],.]
 => [3,1,2,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[.,[.,.]],.],.],.]
 => [2,1,3,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[[.,.],.],.],.],.]
 => [1,2,3,4,5] => [1,1,1,1,1]
 => [1,1,1,1]
 => 1
[.,[.,[.,[.,[.,[.,.]]]]]]
 => [6,5,4,3,2,1] => [6]
 => []
 => ? = 3
[.,[.,[.,[.,[[.,.],.]]]]]
 => [5,6,4,3,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[.,[[.,.],[.,.]]]]]
 => [6,4,5,3,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[.,[[.,[.,.]],.]]]]
 => [5,4,6,3,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[.,[[[.,.],.],.]]]]
 => [4,5,6,3,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,.],[.,[.,.]]]]]
 => [6,5,3,4,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[[.,.],[[.,.],.]]]]
 => [5,6,3,4,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,[.,.]],[.,.]]]]
 => [6,4,3,5,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[[[.,.],.],[.,.]]]]
 => [6,3,4,5,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,[.,[.,.]]],.]]]
 => [5,4,3,6,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[[.,[[.,.],.]],.]]]
 => [4,5,3,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[.,.],[.,.]],.]]]
 => [5,3,4,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[.,[.,.]],.],.]]]
 => [4,3,5,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[[.,.],.],.],.]]]
 => [3,4,5,6,2,1] => [3,1,1,1]
 => [1,1,1]
 => 1
[.,[[.,.],[.,[.,[.,.]]]]]
 => [6,5,4,2,3,1] => [5,1]
 => [1]
 => ? = 2
[.,[[.,.],[.,[[.,.],.]]]]
 => [5,6,4,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[.,.],[.,.]]]]
 => [6,4,5,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[.,[.,.]],.]]]
 => [5,4,6,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[[.,.],.],.]]]
 => [4,5,6,2,3,1] => [3,1,1,1]
 => [1,1,1]
 => 1
[.,[[.,[.,.]],[.,[.,.]]]]
 => [6,5,3,2,4,1] => [5,1]
 => [1]
 => ? = 1
[.,[[.,[.,[.,.]]],[.,.]]]
 => [6,4,3,2,5,1] => [5,1]
 => [1]
 => ? = 1
[.,[[.,[.,[.,[.,.]]]],.]]
 => [5,4,3,2,6,1] => [5,1]
 => [1]
 => ? = 1
[[.,.],[.,[.,[.,[.,.]]]]]
 => [6,5,4,3,1,2] => [5,1]
 => [1]
 => ? = 2
[[.,[.,.]],[.,[.,[.,.]]]]
 => [6,5,4,2,1,3] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,.]]],[.,[.,.]]]
 => [6,5,3,2,1,4] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,[.,.]]]],[.,.]]
 => [6,4,3,2,1,5] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,[.,[.,.]]]]],.]
 => [5,4,3,2,1,6] => [5,1]
 => [1]
 => ? = 2

Description

The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. To be precise, this is given for a partition

$\lambda \vdash n$ by the number of standard tableaux

$T$ of shape

$\lambda$ such that

$\min\big( \operatorname{Des}(T) \cup \{n\} \big)$ is odd. The case of an even minimum is [[St000621]].

Matching statistic: St000668

Mapping

Mp00014: Binary trees —to 132-avoiding permutation⟶ Permutations
Mp00204: Permutations —LLPS⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000668: Integer partitions ⟶ ℤResult quality: 33% ●values known / values provided: 79%●distinct values known / distinct values provided: 33%

Values

[.,.]
 => [1] => [1]
 => []
 => ? = 1
[.,[.,.]]
 => [2,1] => [2]
 => []
 => ? = 1
[[.,.],.]
 => [1,2] => [1,1]
 => [1]
 => ? = 1
[.,[.,[.,.]]]
 => [3,2,1] => [3]
 => []
 => ? = 1
[.,[[.,.],.]]
 => [2,3,1] => [2,1]
 => [1]
 => ? = 1
[[.,.],[.,.]]
 => [3,1,2] => [2,1]
 => [1]
 => ? = 1
[[.,[.,.]],.]
 => [2,1,3] => [2,1]
 => [1]
 => ? = 1
[[[.,.],.],.]
 => [1,2,3] => [1,1,1]
 => [1,1]
 => 1
[.,[.,[.,[.,.]]]]
 => [4,3,2,1] => [4]
 => []
 => ? = 1
[.,[.,[[.,.],.]]]
 => [3,4,2,1] => [3,1]
 => [1]
 => ? = 1
[.,[[.,.],[.,.]]]
 => [4,2,3,1] => [3,1]
 => [1]
 => ? = 1
[.,[[.,[.,.]],.]]
 => [3,2,4,1] => [3,1]
 => [1]
 => ? = 1
[.,[[[.,.],.],.]]
 => [2,3,4,1] => [2,1,1]
 => [1,1]
 => 1
[[.,.],[.,[.,.]]]
 => [4,3,1,2] => [3,1]
 => [1]
 => ? = 1
[[.,.],[[.,.],.]]
 => [3,4,1,2] => [2,1,1]
 => [1,1]
 => 1
[[.,[.,.]],[.,.]]
 => [4,2,1,3] => [3,1]
 => [1]
 => ? = 1
[[[.,.],.],[.,.]]
 => [4,1,2,3] => [2,1,1]
 => [1,1]
 => 1
[[.,[.,[.,.]]],.]
 => [3,2,1,4] => [3,1]
 => [1]
 => ? = 1
[[.,[[.,.],.]],.]
 => [2,3,1,4] => [2,1,1]
 => [1,1]
 => 1
[[[.,.],[.,.]],.]
 => [3,1,2,4] => [2,1,1]
 => [1,1]
 => 1
[[[.,[.,.]],.],.]
 => [2,1,3,4] => [2,1,1]
 => [1,1]
 => 1
[[[[.,.],.],.],.]
 => [1,2,3,4] => [1,1,1,1]
 => [1,1,1]
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => [5,4,3,2,1] => [5]
 => []
 => ? = 2
[.,[.,[.,[[.,.],.]]]]
 => [4,5,3,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[.,.],[.,.]]]]
 => [5,3,4,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[.,[.,.]],.]]]
 => [4,3,5,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[[.,.],.],.]]]
 => [3,4,5,2,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,.],[.,[.,.]]]]
 => [5,4,2,3,1] => [4,1]
 => [1]
 => ? = 1
[.,[[.,.],[[.,.],.]]]
 => [4,5,2,3,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,[.,.]],[.,.]]]
 => [5,3,2,4,1] => [4,1]
 => [1]
 => ? = 1
[.,[[[.,.],.],[.,.]]]
 => [5,2,3,4,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,[.,[.,.]]],.]]
 => [4,3,2,5,1] => [4,1]
 => [1]
 => ? = 1
[.,[[.,[[.,.],.]],.]]
 => [3,4,2,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[.,.],[.,.]],.]]
 => [4,2,3,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[.,[.,.]],.],.]]
 => [3,2,4,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[[.,.],.],.],.]]
 => [2,3,4,5,1] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,.],[.,[.,[.,.]]]]
 => [5,4,3,1,2] => [4,1]
 => [1]
 => ? = 1
[[.,.],[.,[[.,.],.]]]
 => [4,5,3,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[.,.],[.,.]]]
 => [5,3,4,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[.,[.,.]],.]]
 => [4,3,5,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[[.,.],.],.]]
 => [3,4,5,1,2] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,.]],[.,[.,.]]]
 => [5,4,2,1,3] => [4,1]
 => [1]
 => ? = 1
[[.,[.,.]],[[.,.],.]]
 => [4,5,2,1,3] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],.],[.,[.,.]]]
 => [5,4,1,2,3] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],.],[[.,.],.]]
 => [4,5,1,2,3] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,[.,.]]],[.,.]]
 => [5,3,2,1,4] => [4,1]
 => [1]
 => ? = 1
[[.,[[.,.],.]],[.,.]]
 => [5,2,3,1,4] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],[.,.]],[.,.]]
 => [5,3,1,2,4] => [3,1,1]
 => [1,1]
 => 1
[[[.,[.,.]],.],[.,.]]
 => [5,2,1,3,4] => [3,1,1]
 => [1,1]
 => 1
[[[[.,.],.],.],[.,.]]
 => [5,1,2,3,4] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,[.,[.,.]]]],.]
 => [4,3,2,1,5] => [4,1]
 => [1]
 => ? = 1
[[.,[.,[[.,.],.]]],.]
 => [3,4,2,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[.,.],[.,.]]],.]
 => [4,2,3,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[.,[.,.]],.]],.]
 => [3,2,4,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[[.,.],.],.]],.]
 => [2,3,4,1,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,.],[.,[.,.]]],.]
 => [4,3,1,2,5] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],[[.,.],.]],.]
 => [3,4,1,2,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,[.,.]],[.,.]],.]
 => [4,2,1,3,5] => [3,1,1]
 => [1,1]
 => 1
[[[[.,.],.],[.,.]],.]
 => [4,1,2,3,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,[.,[.,.]]],.],.]
 => [3,2,1,4,5] => [3,1,1]
 => [1,1]
 => 1
[[[.,[[.,.],.]],.],.]
 => [2,3,1,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[.,.],[.,.]],.],.]
 => [3,1,2,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[.,[.,.]],.],.],.]
 => [2,1,3,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[[.,.],.],.],.],.]
 => [1,2,3,4,5] => [1,1,1,1,1]
 => [1,1,1,1]
 => 1
[.,[.,[.,[.,[.,[.,.]]]]]]
 => [6,5,4,3,2,1] => [6]
 => []
 => ? = 3
[.,[.,[.,[.,[[.,.],.]]]]]
 => [5,6,4,3,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[.,[[.,.],[.,.]]]]]
 => [6,4,5,3,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[.,[[.,[.,.]],.]]]]
 => [5,4,6,3,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[.,[[[.,.],.],.]]]]
 => [4,5,6,3,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,.],[.,[.,.]]]]]
 => [6,5,3,4,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[[.,.],[[.,.],.]]]]
 => [5,6,3,4,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,[.,.]],[.,.]]]]
 => [6,4,3,5,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[[[.,.],.],[.,.]]]]
 => [6,3,4,5,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,[.,[.,.]]],.]]]
 => [5,4,3,6,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[[.,[[.,.],.]],.]]]
 => [4,5,3,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[.,.],[.,.]],.]]]
 => [5,3,4,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[.,[.,.]],.],.]]]
 => [4,3,5,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[[.,.],.],.],.]]]
 => [3,4,5,6,2,1] => [3,1,1,1]
 => [1,1,1]
 => 1
[.,[[.,.],[.,[.,[.,.]]]]]
 => [6,5,4,2,3,1] => [5,1]
 => [1]
 => ? = 2
[.,[[.,.],[.,[[.,.],.]]]]
 => [5,6,4,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[.,.],[.,.]]]]
 => [6,4,5,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[.,[.,.]],.]]]
 => [5,4,6,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[[.,.],.],.]]]
 => [4,5,6,2,3,1] => [3,1,1,1]
 => [1,1,1]
 => 1
[.,[[.,[.,.]],[.,[.,.]]]]
 => [6,5,3,2,4,1] => [5,1]
 => [1]
 => ? = 1
[.,[[.,[.,[.,.]]],[.,.]]]
 => [6,4,3,2,5,1] => [5,1]
 => [1]
 => ? = 1
[.,[[.,[.,[.,[.,.]]]],.]]
 => [5,4,3,2,6,1] => [5,1]
 => [1]
 => ? = 1
[[.,.],[.,[.,[.,[.,.]]]]]
 => [6,5,4,3,1,2] => [5,1]
 => [1]
 => ? = 2
[[.,[.,.]],[.,[.,[.,.]]]]
 => [6,5,4,2,1,3] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,.]]],[.,[.,.]]]
 => [6,5,3,2,1,4] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,[.,.]]]],[.,.]]
 => [6,4,3,2,1,5] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,[.,[.,.]]]]],.]
 => [5,4,3,2,1,6] => [5,1]
 => [1]
 => ? = 2

Description

The least common multiple of the parts of the partition.

Matching statistic: St000704

Mapping

Mp00014: Binary trees —to 132-avoiding permutation⟶ Permutations
Mp00204: Permutations —LLPS⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000704: Integer partitions ⟶ ℤResult quality: 33% ●values known / values provided: 79%●distinct values known / distinct values provided: 33%

Values

[.,.]
 => [1] => [1]
 => []
 => ? = 1
[.,[.,.]]
 => [2,1] => [2]
 => []
 => ? = 1
[[.,.],.]
 => [1,2] => [1,1]
 => [1]
 => ? = 1
[.,[.,[.,.]]]
 => [3,2,1] => [3]
 => []
 => ? = 1
[.,[[.,.],.]]
 => [2,3,1] => [2,1]
 => [1]
 => ? = 1
[[.,.],[.,.]]
 => [3,1,2] => [2,1]
 => [1]
 => ? = 1
[[.,[.,.]],.]
 => [2,1,3] => [2,1]
 => [1]
 => ? = 1
[[[.,.],.],.]
 => [1,2,3] => [1,1,1]
 => [1,1]
 => 1
[.,[.,[.,[.,.]]]]
 => [4,3,2,1] => [4]
 => []
 => ? = 1
[.,[.,[[.,.],.]]]
 => [3,4,2,1] => [3,1]
 => [1]
 => ? = 1
[.,[[.,.],[.,.]]]
 => [4,2,3,1] => [3,1]
 => [1]
 => ? = 1
[.,[[.,[.,.]],.]]
 => [3,2,4,1] => [3,1]
 => [1]
 => ? = 1
[.,[[[.,.],.],.]]
 => [2,3,4,1] => [2,1,1]
 => [1,1]
 => 1
[[.,.],[.,[.,.]]]
 => [4,3,1,2] => [3,1]
 => [1]
 => ? = 1
[[.,.],[[.,.],.]]
 => [3,4,1,2] => [2,1,1]
 => [1,1]
 => 1
[[.,[.,.]],[.,.]]
 => [4,2,1,3] => [3,1]
 => [1]
 => ? = 1
[[[.,.],.],[.,.]]
 => [4,1,2,3] => [2,1,1]
 => [1,1]
 => 1
[[.,[.,[.,.]]],.]
 => [3,2,1,4] => [3,1]
 => [1]
 => ? = 1
[[.,[[.,.],.]],.]
 => [2,3,1,4] => [2,1,1]
 => [1,1]
 => 1
[[[.,.],[.,.]],.]
 => [3,1,2,4] => [2,1,1]
 => [1,1]
 => 1
[[[.,[.,.]],.],.]
 => [2,1,3,4] => [2,1,1]
 => [1,1]
 => 1
[[[[.,.],.],.],.]
 => [1,2,3,4] => [1,1,1,1]
 => [1,1,1]
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => [5,4,3,2,1] => [5]
 => []
 => ? = 2
[.,[.,[.,[[.,.],.]]]]
 => [4,5,3,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[.,.],[.,.]]]]
 => [5,3,4,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[.,[.,.]],.]]]
 => [4,3,5,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[[.,.],.],.]]]
 => [3,4,5,2,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,.],[.,[.,.]]]]
 => [5,4,2,3,1] => [4,1]
 => [1]
 => ? = 1
[.,[[.,.],[[.,.],.]]]
 => [4,5,2,3,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,[.,.]],[.,.]]]
 => [5,3,2,4,1] => [4,1]
 => [1]
 => ? = 1
[.,[[[.,.],.],[.,.]]]
 => [5,2,3,4,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,[.,[.,.]]],.]]
 => [4,3,2,5,1] => [4,1]
 => [1]
 => ? = 1
[.,[[.,[[.,.],.]],.]]
 => [3,4,2,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[.,.],[.,.]],.]]
 => [4,2,3,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[.,[.,.]],.],.]]
 => [3,2,4,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[[.,.],.],.],.]]
 => [2,3,4,5,1] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,.],[.,[.,[.,.]]]]
 => [5,4,3,1,2] => [4,1]
 => [1]
 => ? = 1
[[.,.],[.,[[.,.],.]]]
 => [4,5,3,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[.,.],[.,.]]]
 => [5,3,4,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[.,[.,.]],.]]
 => [4,3,5,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[[.,.],.],.]]
 => [3,4,5,1,2] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,.]],[.,[.,.]]]
 => [5,4,2,1,3] => [4,1]
 => [1]
 => ? = 1
[[.,[.,.]],[[.,.],.]]
 => [4,5,2,1,3] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],.],[.,[.,.]]]
 => [5,4,1,2,3] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],.],[[.,.],.]]
 => [4,5,1,2,3] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,[.,.]]],[.,.]]
 => [5,3,2,1,4] => [4,1]
 => [1]
 => ? = 1
[[.,[[.,.],.]],[.,.]]
 => [5,2,3,1,4] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],[.,.]],[.,.]]
 => [5,3,1,2,4] => [3,1,1]
 => [1,1]
 => 1
[[[.,[.,.]],.],[.,.]]
 => [5,2,1,3,4] => [3,1,1]
 => [1,1]
 => 1
[[[[.,.],.],.],[.,.]]
 => [5,1,2,3,4] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,[.,[.,.]]]],.]
 => [4,3,2,1,5] => [4,1]
 => [1]
 => ? = 1
[[.,[.,[[.,.],.]]],.]
 => [3,4,2,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[.,.],[.,.]]],.]
 => [4,2,3,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[.,[.,.]],.]],.]
 => [3,2,4,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[[.,.],.],.]],.]
 => [2,3,4,1,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,.],[.,[.,.]]],.]
 => [4,3,1,2,5] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],[[.,.],.]],.]
 => [3,4,1,2,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,[.,.]],[.,.]],.]
 => [4,2,1,3,5] => [3,1,1]
 => [1,1]
 => 1
[[[[.,.],.],[.,.]],.]
 => [4,1,2,3,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,[.,[.,.]]],.],.]
 => [3,2,1,4,5] => [3,1,1]
 => [1,1]
 => 1
[[[.,[[.,.],.]],.],.]
 => [2,3,1,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[.,.],[.,.]],.],.]
 => [3,1,2,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[.,[.,.]],.],.],.]
 => [2,1,3,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[[.,.],.],.],.],.]
 => [1,2,3,4,5] => [1,1,1,1,1]
 => [1,1,1,1]
 => 1
[.,[.,[.,[.,[.,[.,.]]]]]]
 => [6,5,4,3,2,1] => [6]
 => []
 => ? = 3
[.,[.,[.,[.,[[.,.],.]]]]]
 => [5,6,4,3,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[.,[[.,.],[.,.]]]]]
 => [6,4,5,3,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[.,[[.,[.,.]],.]]]]
 => [5,4,6,3,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[.,[[[.,.],.],.]]]]
 => [4,5,6,3,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,.],[.,[.,.]]]]]
 => [6,5,3,4,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[[.,.],[[.,.],.]]]]
 => [5,6,3,4,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,[.,.]],[.,.]]]]
 => [6,4,3,5,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[[[.,.],.],[.,.]]]]
 => [6,3,4,5,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,[.,[.,.]]],.]]]
 => [5,4,3,6,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[[.,[[.,.],.]],.]]]
 => [4,5,3,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[.,.],[.,.]],.]]]
 => [5,3,4,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[.,[.,.]],.],.]]]
 => [4,3,5,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[[.,.],.],.],.]]]
 => [3,4,5,6,2,1] => [3,1,1,1]
 => [1,1,1]
 => 1
[.,[[.,.],[.,[.,[.,.]]]]]
 => [6,5,4,2,3,1] => [5,1]
 => [1]
 => ? = 2
[.,[[.,.],[.,[[.,.],.]]]]
 => [5,6,4,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[.,.],[.,.]]]]
 => [6,4,5,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[.,[.,.]],.]]]
 => [5,4,6,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[[.,.],.],.]]]
 => [4,5,6,2,3,1] => [3,1,1,1]
 => [1,1,1]
 => 1
[.,[[.,[.,.]],[.,[.,.]]]]
 => [6,5,3,2,4,1] => [5,1]
 => [1]
 => ? = 1
[.,[[.,[.,[.,.]]],[.,.]]]
 => [6,4,3,2,5,1] => [5,1]
 => [1]
 => ? = 1
[.,[[.,[.,[.,[.,.]]]],.]]
 => [5,4,3,2,6,1] => [5,1]
 => [1]
 => ? = 1
[[.,.],[.,[.,[.,[.,.]]]]]
 => [6,5,4,3,1,2] => [5,1]
 => [1]
 => ? = 2
[[.,[.,.]],[.,[.,[.,.]]]]
 => [6,5,4,2,1,3] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,.]]],[.,[.,.]]]
 => [6,5,3,2,1,4] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,[.,.]]]],[.,.]]
 => [6,4,3,2,1,5] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,[.,[.,.]]]]],.]
 => [5,4,3,2,1,6] => [5,1]
 => [1]
 => ? = 2

Description

The number of semistandard tableaux on a given integer partition with minimal maximal entry. This is, for an integer partition

$\lambda = (\lambda_1 > \cdots > \lambda_k > 0)$ , the number of [[SemistandardTableaux|semistandard tableaux]] of shape

$\lambda$ with maximal entry

$k$ . Equivalently, this is the evaluation

$s_\lambda(1,\ldots,1)$ of the Schur function

$s_\lambda$ in

$k$ variables, or, explicitly,

$\prod_{(i,j) \in L} \frac{k + j - i}{ \operatorname{hook}(i,j) }$ where the product is over all cells

$(i,j) \in L$ and

$\operatorname{hook}(i,j)$ is the hook length of a cell. See [Theorem 6.3, 1] for details.

Matching statistic: St000707

Mapping

Mp00014: Binary trees —to 132-avoiding permutation⟶ Permutations
Mp00204: Permutations —LLPS⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000707: Integer partitions ⟶ ℤResult quality: 33% ●values known / values provided: 79%●distinct values known / distinct values provided: 33%

Values

[.,.]
 => [1] => [1]
 => []
 => ? = 1
[.,[.,.]]
 => [2,1] => [2]
 => []
 => ? = 1
[[.,.],.]
 => [1,2] => [1,1]
 => [1]
 => ? = 1
[.,[.,[.,.]]]
 => [3,2,1] => [3]
 => []
 => ? = 1
[.,[[.,.],.]]
 => [2,3,1] => [2,1]
 => [1]
 => ? = 1
[[.,.],[.,.]]
 => [3,1,2] => [2,1]
 => [1]
 => ? = 1
[[.,[.,.]],.]
 => [2,1,3] => [2,1]
 => [1]
 => ? = 1
[[[.,.],.],.]
 => [1,2,3] => [1,1,1]
 => [1,1]
 => 1
[.,[.,[.,[.,.]]]]
 => [4,3,2,1] => [4]
 => []
 => ? = 1
[.,[.,[[.,.],.]]]
 => [3,4,2,1] => [3,1]
 => [1]
 => ? = 1
[.,[[.,.],[.,.]]]
 => [4,2,3,1] => [3,1]
 => [1]
 => ? = 1
[.,[[.,[.,.]],.]]
 => [3,2,4,1] => [3,1]
 => [1]
 => ? = 1
[.,[[[.,.],.],.]]
 => [2,3,4,1] => [2,1,1]
 => [1,1]
 => 1
[[.,.],[.,[.,.]]]
 => [4,3,1,2] => [3,1]
 => [1]
 => ? = 1
[[.,.],[[.,.],.]]
 => [3,4,1,2] => [2,1,1]
 => [1,1]
 => 1
[[.,[.,.]],[.,.]]
 => [4,2,1,3] => [3,1]
 => [1]
 => ? = 1
[[[.,.],.],[.,.]]
 => [4,1,2,3] => [2,1,1]
 => [1,1]
 => 1
[[.,[.,[.,.]]],.]
 => [3,2,1,4] => [3,1]
 => [1]
 => ? = 1
[[.,[[.,.],.]],.]
 => [2,3,1,4] => [2,1,1]
 => [1,1]
 => 1
[[[.,.],[.,.]],.]
 => [3,1,2,4] => [2,1,1]
 => [1,1]
 => 1
[[[.,[.,.]],.],.]
 => [2,1,3,4] => [2,1,1]
 => [1,1]
 => 1
[[[[.,.],.],.],.]
 => [1,2,3,4] => [1,1,1,1]
 => [1,1,1]
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => [5,4,3,2,1] => [5]
 => []
 => ? = 2
[.,[.,[.,[[.,.],.]]]]
 => [4,5,3,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[.,.],[.,.]]]]
 => [5,3,4,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[.,[.,.]],.]]]
 => [4,3,5,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[[.,.],.],.]]]
 => [3,4,5,2,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,.],[.,[.,.]]]]
 => [5,4,2,3,1] => [4,1]
 => [1]
 => ? = 1
[.,[[.,.],[[.,.],.]]]
 => [4,5,2,3,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,[.,.]],[.,.]]]
 => [5,3,2,4,1] => [4,1]
 => [1]
 => ? = 1
[.,[[[.,.],.],[.,.]]]
 => [5,2,3,4,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,[.,[.,.]]],.]]
 => [4,3,2,5,1] => [4,1]
 => [1]
 => ? = 1
[.,[[.,[[.,.],.]],.]]
 => [3,4,2,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[.,.],[.,.]],.]]
 => [4,2,3,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[.,[.,.]],.],.]]
 => [3,2,4,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[[.,.],.],.],.]]
 => [2,3,4,5,1] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,.],[.,[.,[.,.]]]]
 => [5,4,3,1,2] => [4,1]
 => [1]
 => ? = 1
[[.,.],[.,[[.,.],.]]]
 => [4,5,3,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[.,.],[.,.]]]
 => [5,3,4,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[.,[.,.]],.]]
 => [4,3,5,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[[.,.],.],.]]
 => [3,4,5,1,2] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,.]],[.,[.,.]]]
 => [5,4,2,1,3] => [4,1]
 => [1]
 => ? = 1
[[.,[.,.]],[[.,.],.]]
 => [4,5,2,1,3] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],.],[.,[.,.]]]
 => [5,4,1,2,3] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],.],[[.,.],.]]
 => [4,5,1,2,3] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,[.,.]]],[.,.]]
 => [5,3,2,1,4] => [4,1]
 => [1]
 => ? = 1
[[.,[[.,.],.]],[.,.]]
 => [5,2,3,1,4] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],[.,.]],[.,.]]
 => [5,3,1,2,4] => [3,1,1]
 => [1,1]
 => 1
[[[.,[.,.]],.],[.,.]]
 => [5,2,1,3,4] => [3,1,1]
 => [1,1]
 => 1
[[[[.,.],.],.],[.,.]]
 => [5,1,2,3,4] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,[.,[.,.]]]],.]
 => [4,3,2,1,5] => [4,1]
 => [1]
 => ? = 1
[[.,[.,[[.,.],.]]],.]
 => [3,4,2,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[.,.],[.,.]]],.]
 => [4,2,3,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[.,[.,.]],.]],.]
 => [3,2,4,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[[.,.],.],.]],.]
 => [2,3,4,1,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,.],[.,[.,.]]],.]
 => [4,3,1,2,5] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],[[.,.],.]],.]
 => [3,4,1,2,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,[.,.]],[.,.]],.]
 => [4,2,1,3,5] => [3,1,1]
 => [1,1]
 => 1
[[[[.,.],.],[.,.]],.]
 => [4,1,2,3,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,[.,[.,.]]],.],.]
 => [3,2,1,4,5] => [3,1,1]
 => [1,1]
 => 1
[[[.,[[.,.],.]],.],.]
 => [2,3,1,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[.,.],[.,.]],.],.]
 => [3,1,2,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[.,[.,.]],.],.],.]
 => [2,1,3,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[[.,.],.],.],.],.]
 => [1,2,3,4,5] => [1,1,1,1,1]
 => [1,1,1,1]
 => 1
[.,[.,[.,[.,[.,[.,.]]]]]]
 => [6,5,4,3,2,1] => [6]
 => []
 => ? = 3
[.,[.,[.,[.,[[.,.],.]]]]]
 => [5,6,4,3,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[.,[[.,.],[.,.]]]]]
 => [6,4,5,3,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[.,[[.,[.,.]],.]]]]
 => [5,4,6,3,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[.,[[[.,.],.],.]]]]
 => [4,5,6,3,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,.],[.,[.,.]]]]]
 => [6,5,3,4,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[[.,.],[[.,.],.]]]]
 => [5,6,3,4,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,[.,.]],[.,.]]]]
 => [6,4,3,5,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[[[.,.],.],[.,.]]]]
 => [6,3,4,5,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,[.,[.,.]]],.]]]
 => [5,4,3,6,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[[.,[[.,.],.]],.]]]
 => [4,5,3,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[.,.],[.,.]],.]]]
 => [5,3,4,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[.,[.,.]],.],.]]]
 => [4,3,5,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[[.,.],.],.],.]]]
 => [3,4,5,6,2,1] => [3,1,1,1]
 => [1,1,1]
 => 1
[.,[[.,.],[.,[.,[.,.]]]]]
 => [6,5,4,2,3,1] => [5,1]
 => [1]
 => ? = 2
[.,[[.,.],[.,[[.,.],.]]]]
 => [5,6,4,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[.,.],[.,.]]]]
 => [6,4,5,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[.,[.,.]],.]]]
 => [5,4,6,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[[.,.],.],.]]]
 => [4,5,6,2,3,1] => [3,1,1,1]
 => [1,1,1]
 => 1
[.,[[.,[.,.]],[.,[.,.]]]]
 => [6,5,3,2,4,1] => [5,1]
 => [1]
 => ? = 1
[.,[[.,[.,[.,.]]],[.,.]]]
 => [6,4,3,2,5,1] => [5,1]
 => [1]
 => ? = 1
[.,[[.,[.,[.,[.,.]]]],.]]
 => [5,4,3,2,6,1] => [5,1]
 => [1]
 => ? = 1
[[.,.],[.,[.,[.,[.,.]]]]]
 => [6,5,4,3,1,2] => [5,1]
 => [1]
 => ? = 2
[[.,[.,.]],[.,[.,[.,.]]]]
 => [6,5,4,2,1,3] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,.]]],[.,[.,.]]]
 => [6,5,3,2,1,4] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,[.,.]]]],[.,.]]
 => [6,4,3,2,1,5] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,[.,[.,.]]]]],.]
 => [5,4,3,2,1,6] => [5,1]
 => [1]
 => ? = 2

Description

The product of the factorials of the parts.

Matching statistic: St000708

Mapping

Mp00014: Binary trees —to 132-avoiding permutation⟶ Permutations
Mp00204: Permutations —LLPS⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000708: Integer partitions ⟶ ℤResult quality: 33% ●values known / values provided: 79%●distinct values known / distinct values provided: 33%

Values

[.,.]
 => [1] => [1]
 => []
 => ? = 1
[.,[.,.]]
 => [2,1] => [2]
 => []
 => ? = 1
[[.,.],.]
 => [1,2] => [1,1]
 => [1]
 => ? = 1
[.,[.,[.,.]]]
 => [3,2,1] => [3]
 => []
 => ? = 1
[.,[[.,.],.]]
 => [2,3,1] => [2,1]
 => [1]
 => ? = 1
[[.,.],[.,.]]
 => [3,1,2] => [2,1]
 => [1]
 => ? = 1
[[.,[.,.]],.]
 => [2,1,3] => [2,1]
 => [1]
 => ? = 1
[[[.,.],.],.]
 => [1,2,3] => [1,1,1]
 => [1,1]
 => 1
[.,[.,[.,[.,.]]]]
 => [4,3,2,1] => [4]
 => []
 => ? = 1
[.,[.,[[.,.],.]]]
 => [3,4,2,1] => [3,1]
 => [1]
 => ? = 1
[.,[[.,.],[.,.]]]
 => [4,2,3,1] => [3,1]
 => [1]
 => ? = 1
[.,[[.,[.,.]],.]]
 => [3,2,4,1] => [3,1]
 => [1]
 => ? = 1
[.,[[[.,.],.],.]]
 => [2,3,4,1] => [2,1,1]
 => [1,1]
 => 1
[[.,.],[.,[.,.]]]
 => [4,3,1,2] => [3,1]
 => [1]
 => ? = 1
[[.,.],[[.,.],.]]
 => [3,4,1,2] => [2,1,1]
 => [1,1]
 => 1
[[.,[.,.]],[.,.]]
 => [4,2,1,3] => [3,1]
 => [1]
 => ? = 1
[[[.,.],.],[.,.]]
 => [4,1,2,3] => [2,1,1]
 => [1,1]
 => 1
[[.,[.,[.,.]]],.]
 => [3,2,1,4] => [3,1]
 => [1]
 => ? = 1
[[.,[[.,.],.]],.]
 => [2,3,1,4] => [2,1,1]
 => [1,1]
 => 1
[[[.,.],[.,.]],.]
 => [3,1,2,4] => [2,1,1]
 => [1,1]
 => 1
[[[.,[.,.]],.],.]
 => [2,1,3,4] => [2,1,1]
 => [1,1]
 => 1
[[[[.,.],.],.],.]
 => [1,2,3,4] => [1,1,1,1]
 => [1,1,1]
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => [5,4,3,2,1] => [5]
 => []
 => ? = 2
[.,[.,[.,[[.,.],.]]]]
 => [4,5,3,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[.,.],[.,.]]]]
 => [5,3,4,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[.,[.,.]],.]]]
 => [4,3,5,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[[.,.],.],.]]]
 => [3,4,5,2,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,.],[.,[.,.]]]]
 => [5,4,2,3,1] => [4,1]
 => [1]
 => ? = 1
[.,[[.,.],[[.,.],.]]]
 => [4,5,2,3,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,[.,.]],[.,.]]]
 => [5,3,2,4,1] => [4,1]
 => [1]
 => ? = 1
[.,[[[.,.],.],[.,.]]]
 => [5,2,3,4,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,[.,[.,.]]],.]]
 => [4,3,2,5,1] => [4,1]
 => [1]
 => ? = 1
[.,[[.,[[.,.],.]],.]]
 => [3,4,2,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[.,.],[.,.]],.]]
 => [4,2,3,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[.,[.,.]],.],.]]
 => [3,2,4,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[[.,.],.],.],.]]
 => [2,3,4,5,1] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,.],[.,[.,[.,.]]]]
 => [5,4,3,1,2] => [4,1]
 => [1]
 => ? = 1
[[.,.],[.,[[.,.],.]]]
 => [4,5,3,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[.,.],[.,.]]]
 => [5,3,4,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[.,[.,.]],.]]
 => [4,3,5,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[[.,.],.],.]]
 => [3,4,5,1,2] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,.]],[.,[.,.]]]
 => [5,4,2,1,3] => [4,1]
 => [1]
 => ? = 1
[[.,[.,.]],[[.,.],.]]
 => [4,5,2,1,3] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],.],[.,[.,.]]]
 => [5,4,1,2,3] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],.],[[.,.],.]]
 => [4,5,1,2,3] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,[.,.]]],[.,.]]
 => [5,3,2,1,4] => [4,1]
 => [1]
 => ? = 1
[[.,[[.,.],.]],[.,.]]
 => [5,2,3,1,4] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],[.,.]],[.,.]]
 => [5,3,1,2,4] => [3,1,1]
 => [1,1]
 => 1
[[[.,[.,.]],.],[.,.]]
 => [5,2,1,3,4] => [3,1,1]
 => [1,1]
 => 1
[[[[.,.],.],.],[.,.]]
 => [5,1,2,3,4] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,[.,[.,.]]]],.]
 => [4,3,2,1,5] => [4,1]
 => [1]
 => ? = 1
[[.,[.,[[.,.],.]]],.]
 => [3,4,2,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[.,.],[.,.]]],.]
 => [4,2,3,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[.,[.,.]],.]],.]
 => [3,2,4,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[[.,.],.],.]],.]
 => [2,3,4,1,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,.],[.,[.,.]]],.]
 => [4,3,1,2,5] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],[[.,.],.]],.]
 => [3,4,1,2,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,[.,.]],[.,.]],.]
 => [4,2,1,3,5] => [3,1,1]
 => [1,1]
 => 1
[[[[.,.],.],[.,.]],.]
 => [4,1,2,3,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,[.,[.,.]]],.],.]
 => [3,2,1,4,5] => [3,1,1]
 => [1,1]
 => 1
[[[.,[[.,.],.]],.],.]
 => [2,3,1,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[.,.],[.,.]],.],.]
 => [3,1,2,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[.,[.,.]],.],.],.]
 => [2,1,3,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[[.,.],.],.],.],.]
 => [1,2,3,4,5] => [1,1,1,1,1]
 => [1,1,1,1]
 => 1
[.,[.,[.,[.,[.,[.,.]]]]]]
 => [6,5,4,3,2,1] => [6]
 => []
 => ? = 3
[.,[.,[.,[.,[[.,.],.]]]]]
 => [5,6,4,3,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[.,[[.,.],[.,.]]]]]
 => [6,4,5,3,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[.,[[.,[.,.]],.]]]]
 => [5,4,6,3,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[.,[[[.,.],.],.]]]]
 => [4,5,6,3,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,.],[.,[.,.]]]]]
 => [6,5,3,4,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[[.,.],[[.,.],.]]]]
 => [5,6,3,4,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,[.,.]],[.,.]]]]
 => [6,4,3,5,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[[[.,.],.],[.,.]]]]
 => [6,3,4,5,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,[.,[.,.]]],.]]]
 => [5,4,3,6,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[[.,[[.,.],.]],.]]]
 => [4,5,3,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[.,.],[.,.]],.]]]
 => [5,3,4,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[.,[.,.]],.],.]]]
 => [4,3,5,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[[.,.],.],.],.]]]
 => [3,4,5,6,2,1] => [3,1,1,1]
 => [1,1,1]
 => 1
[.,[[.,.],[.,[.,[.,.]]]]]
 => [6,5,4,2,3,1] => [5,1]
 => [1]
 => ? = 2
[.,[[.,.],[.,[[.,.],.]]]]
 => [5,6,4,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[.,.],[.,.]]]]
 => [6,4,5,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[.,[.,.]],.]]]
 => [5,4,6,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[[.,.],.],.]]]
 => [4,5,6,2,3,1] => [3,1,1,1]
 => [1,1,1]
 => 1
[.,[[.,[.,.]],[.,[.,.]]]]
 => [6,5,3,2,4,1] => [5,1]
 => [1]
 => ? = 1
[.,[[.,[.,[.,.]]],[.,.]]]
 => [6,4,3,2,5,1] => [5,1]
 => [1]
 => ? = 1
[.,[[.,[.,[.,[.,.]]]],.]]
 => [5,4,3,2,6,1] => [5,1]
 => [1]
 => ? = 1
[[.,.],[.,[.,[.,[.,.]]]]]
 => [6,5,4,3,1,2] => [5,1]
 => [1]
 => ? = 2
[[.,[.,.]],[.,[.,[.,.]]]]
 => [6,5,4,2,1,3] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,.]]],[.,[.,.]]]
 => [6,5,3,2,1,4] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,[.,.]]]],[.,.]]
 => [6,4,3,2,1,5] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,[.,[.,.]]]]],.]
 => [5,4,3,2,1,6] => [5,1]
 => [1]
 => ? = 2

Description

The product of the parts of an integer partition.

Matching statistic: St000770

Mapping

Mp00014: Binary trees —to 132-avoiding permutation⟶ Permutations
Mp00204: Permutations —LLPS⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000770: Integer partitions ⟶ ℤResult quality: 33% ●values known / values provided: 79%●distinct values known / distinct values provided: 33%

Values

[.,.]
 => [1] => [1]
 => []
 => ? = 1
[.,[.,.]]
 => [2,1] => [2]
 => []
 => ? = 1
[[.,.],.]
 => [1,2] => [1,1]
 => [1]
 => ? = 1
[.,[.,[.,.]]]
 => [3,2,1] => [3]
 => []
 => ? = 1
[.,[[.,.],.]]
 => [2,3,1] => [2,1]
 => [1]
 => ? = 1
[[.,.],[.,.]]
 => [3,1,2] => [2,1]
 => [1]
 => ? = 1
[[.,[.,.]],.]
 => [2,1,3] => [2,1]
 => [1]
 => ? = 1
[[[.,.],.],.]
 => [1,2,3] => [1,1,1]
 => [1,1]
 => 1
[.,[.,[.,[.,.]]]]
 => [4,3,2,1] => [4]
 => []
 => ? = 1
[.,[.,[[.,.],.]]]
 => [3,4,2,1] => [3,1]
 => [1]
 => ? = 1
[.,[[.,.],[.,.]]]
 => [4,2,3,1] => [3,1]
 => [1]
 => ? = 1
[.,[[.,[.,.]],.]]
 => [3,2,4,1] => [3,1]
 => [1]
 => ? = 1
[.,[[[.,.],.],.]]
 => [2,3,4,1] => [2,1,1]
 => [1,1]
 => 1
[[.,.],[.,[.,.]]]
 => [4,3,1,2] => [3,1]
 => [1]
 => ? = 1
[[.,.],[[.,.],.]]
 => [3,4,1,2] => [2,1,1]
 => [1,1]
 => 1
[[.,[.,.]],[.,.]]
 => [4,2,1,3] => [3,1]
 => [1]
 => ? = 1
[[[.,.],.],[.,.]]
 => [4,1,2,3] => [2,1,1]
 => [1,1]
 => 1
[[.,[.,[.,.]]],.]
 => [3,2,1,4] => [3,1]
 => [1]
 => ? = 1
[[.,[[.,.],.]],.]
 => [2,3,1,4] => [2,1,1]
 => [1,1]
 => 1
[[[.,.],[.,.]],.]
 => [3,1,2,4] => [2,1,1]
 => [1,1]
 => 1
[[[.,[.,.]],.],.]
 => [2,1,3,4] => [2,1,1]
 => [1,1]
 => 1
[[[[.,.],.],.],.]
 => [1,2,3,4] => [1,1,1,1]
 => [1,1,1]
 => 1
[.,[.,[.,[.,[.,.]]]]]
 => [5,4,3,2,1] => [5]
 => []
 => ? = 2
[.,[.,[.,[[.,.],.]]]]
 => [4,5,3,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[.,.],[.,.]]]]
 => [5,3,4,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[.,[.,.]],.]]]
 => [4,3,5,2,1] => [4,1]
 => [1]
 => ? = 1
[.,[.,[[[.,.],.],.]]]
 => [3,4,5,2,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,.],[.,[.,.]]]]
 => [5,4,2,3,1] => [4,1]
 => [1]
 => ? = 1
[.,[[.,.],[[.,.],.]]]
 => [4,5,2,3,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,[.,.]],[.,.]]]
 => [5,3,2,4,1] => [4,1]
 => [1]
 => ? = 1
[.,[[[.,.],.],[.,.]]]
 => [5,2,3,4,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[.,[.,[.,.]]],.]]
 => [4,3,2,5,1] => [4,1]
 => [1]
 => ? = 1
[.,[[.,[[.,.],.]],.]]
 => [3,4,2,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[.,.],[.,.]],.]]
 => [4,2,3,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[.,[.,.]],.],.]]
 => [3,2,4,5,1] => [3,1,1]
 => [1,1]
 => 1
[.,[[[[.,.],.],.],.]]
 => [2,3,4,5,1] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,.],[.,[.,[.,.]]]]
 => [5,4,3,1,2] => [4,1]
 => [1]
 => ? = 1
[[.,.],[.,[[.,.],.]]]
 => [4,5,3,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[.,.],[.,.]]]
 => [5,3,4,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[.,[.,.]],.]]
 => [4,3,5,1,2] => [3,1,1]
 => [1,1]
 => 1
[[.,.],[[[.,.],.],.]]
 => [3,4,5,1,2] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,.]],[.,[.,.]]]
 => [5,4,2,1,3] => [4,1]
 => [1]
 => ? = 1
[[.,[.,.]],[[.,.],.]]
 => [4,5,2,1,3] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],.],[.,[.,.]]]
 => [5,4,1,2,3] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],.],[[.,.],.]]
 => [4,5,1,2,3] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,[.,.]]],[.,.]]
 => [5,3,2,1,4] => [4,1]
 => [1]
 => ? = 1
[[.,[[.,.],.]],[.,.]]
 => [5,2,3,1,4] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],[.,.]],[.,.]]
 => [5,3,1,2,4] => [3,1,1]
 => [1,1]
 => 1
[[[.,[.,.]],.],[.,.]]
 => [5,2,1,3,4] => [3,1,1]
 => [1,1]
 => 1
[[[[.,.],.],.],[.,.]]
 => [5,1,2,3,4] => [2,1,1,1]
 => [1,1,1]
 => 1
[[.,[.,[.,[.,.]]]],.]
 => [4,3,2,1,5] => [4,1]
 => [1]
 => ? = 1
[[.,[.,[[.,.],.]]],.]
 => [3,4,2,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[.,.],[.,.]]],.]
 => [4,2,3,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[.,[.,.]],.]],.]
 => [3,2,4,1,5] => [3,1,1]
 => [1,1]
 => 1
[[.,[[[.,.],.],.]],.]
 => [2,3,4,1,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,.],[.,[.,.]]],.]
 => [4,3,1,2,5] => [3,1,1]
 => [1,1]
 => 1
[[[.,.],[[.,.],.]],.]
 => [3,4,1,2,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,[.,.]],[.,.]],.]
 => [4,2,1,3,5] => [3,1,1]
 => [1,1]
 => 1
[[[[.,.],.],[.,.]],.]
 => [4,1,2,3,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[.,[.,[.,.]]],.],.]
 => [3,2,1,4,5] => [3,1,1]
 => [1,1]
 => 1
[[[.,[[.,.],.]],.],.]
 => [2,3,1,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[.,.],[.,.]],.],.]
 => [3,1,2,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[.,[.,.]],.],.],.]
 => [2,1,3,4,5] => [2,1,1,1]
 => [1,1,1]
 => 1
[[[[[.,.],.],.],.],.]
 => [1,2,3,4,5] => [1,1,1,1,1]
 => [1,1,1,1]
 => 1
[.,[.,[.,[.,[.,[.,.]]]]]]
 => [6,5,4,3,2,1] => [6]
 => []
 => ? = 3
[.,[.,[.,[.,[[.,.],.]]]]]
 => [5,6,4,3,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[.,[[.,.],[.,.]]]]]
 => [6,4,5,3,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[.,[[.,[.,.]],.]]]]
 => [5,4,6,3,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[.,[[[.,.],.],.]]]]
 => [4,5,6,3,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,.],[.,[.,.]]]]]
 => [6,5,3,4,2,1] => [5,1]
 => [1]
 => ? = 2
[.,[.,[[.,.],[[.,.],.]]]]
 => [5,6,3,4,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,[.,.]],[.,.]]]]
 => [6,4,3,5,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[[[.,.],.],[.,.]]]]
 => [6,3,4,5,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[.,[.,[.,.]]],.]]]
 => [5,4,3,6,2,1] => [5,1]
 => [1]
 => ? = 1
[.,[.,[[.,[[.,.],.]],.]]]
 => [4,5,3,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[.,.],[.,.]],.]]]
 => [5,3,4,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[.,[.,.]],.],.]]]
 => [4,3,5,6,2,1] => [4,1,1]
 => [1,1]
 => 1
[.,[.,[[[[.,.],.],.],.]]]
 => [3,4,5,6,2,1] => [3,1,1,1]
 => [1,1,1]
 => 1
[.,[[.,.],[.,[.,[.,.]]]]]
 => [6,5,4,2,3,1] => [5,1]
 => [1]
 => ? = 2
[.,[[.,.],[.,[[.,.],.]]]]
 => [5,6,4,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[.,.],[.,.]]]]
 => [6,4,5,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[.,[.,.]],.]]]
 => [5,4,6,2,3,1] => [4,1,1]
 => [1,1]
 => 1
[.,[[.,.],[[[.,.],.],.]]]
 => [4,5,6,2,3,1] => [3,1,1,1]
 => [1,1,1]
 => 1
[.,[[.,[.,.]],[.,[.,.]]]]
 => [6,5,3,2,4,1] => [5,1]
 => [1]
 => ? = 1
[.,[[.,[.,[.,.]]],[.,.]]]
 => [6,4,3,2,5,1] => [5,1]
 => [1]
 => ? = 1
[.,[[.,[.,[.,[.,.]]]],.]]
 => [5,4,3,2,6,1] => [5,1]
 => [1]
 => ? = 1
[[.,.],[.,[.,[.,[.,.]]]]]
 => [6,5,4,3,1,2] => [5,1]
 => [1]
 => ? = 2
[[.,[.,.]],[.,[.,[.,.]]]]
 => [6,5,4,2,1,3] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,.]]],[.,[.,.]]]
 => [6,5,3,2,1,4] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,[.,.]]]],[.,.]]
 => [6,4,3,2,1,5] => [5,1]
 => [1]
 => ? = 1
[[.,[.,[.,[.,[.,.]]]]],.]
 => [5,4,3,2,1,6] => [5,1]
 => [1]
 => ? = 2

Description

The major index of an integer partition when read from bottom to top. This is the sum of the positions of the corners of the shape of an integer partition when reading from bottom to top. For example, the partition

$\lambda = (8,6,6,4,3,3)$ has corners at positions 3,6,9, and 13, giving a major index of 31.

The following 200 statistics, ordered by result quality, also match your data. Click on any of them to see the details.

St000815The number of semistandard Young tableaux of partition weight of given shape. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000929The constant term of the character polynomial of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St001128The exponens consonantiae of a partition. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000478Another weight of a partition according to Alladi. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000934The 2-degree of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001568The smallest positive integer that does not appear twice in the partition. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St000264The girth of a graph, which is not a tree. St001695The natural comajor index of a standard Young tableau. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001699The major index of a standard tableau minus the weighted size of its shape. St001712The number of natural descents of a standard Young tableau. St001545The second Elser number of a connected graph. St000908The length of the shortest maximal antichain in a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000914The sum of the values of the Möbius function of a poset. St001271The competition number of a graph. St000455The second largest eigenvalue of a graph if it is integral. St000297The number of leading ones in a binary word. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001820The size of the image of the pop stack sorting operator. St001845The number of join irreducibles minus the rank of a lattice. St001846The number of elements which do not have a complement in the lattice. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001549The number of restricted non-inversions between exceedances. St001866The nesting alignments of a signed permutation. St000889The number of alternating sign matrices with the same antidiagonal sums. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001890The maximum magnitude of the Möbius function of a poset. St001720The minimal length of a chain of small intervals in a lattice. St001195The global dimension of the algebra

$A/AfA$ of the corresponding Nakayama algebra

$A$ with minimal left faithful projective-injective module

$Af$ . St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000879The number of long braid edges in the graph of braid moves of a permutation. St001198The number of simple modules in the algebra

$eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra

$A$ with minimal faithful projective-injective module

$eA$ . 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$ . St001206The maximal dimension of an indecomposable projective

$eAe$ -module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module

$eA$ . St001498The normalised height of a Nakayama algebra with magnitude 1. St001199The dominant dimension of

$eAe$ for the corresponding Nakayama algebra

$A$ with minimal faithful projective-injective module

$eA$ . St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001862The number of crossings of a signed permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001895The oddness of a signed permutation. St000326The position of the first one in a binary word after appending a 1 at the end. St000096The number of spanning trees of a graph. St000181The number of connected components of the Hasse diagram for the poset. St000287The number of connected components of a graph. St000450The number of edges minus the number of vertices plus 2 of a graph. St001518The number of graphs with the same ordinary spectrum as the given graph. St001828The Euler characteristic of a graph. St000095The number of triangles of a graph. St000274The number of perfect matchings of a graph. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by

$4$ . St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001690The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path. St001783The number of odd automorphisms of a graph. St001871The number of triconnected components of a graph. St000286The number of connected components of the complement of a graph. St001496The number of graphs with the same Laplacian spectrum as the given graph. St001307The number of induced stars on four vertices in a graph. St001323The independence gap of a graph. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001347The number of pairs of vertices of a graph having the same neighbourhood. St000068The number of minimal elements in a poset. St000379The number of Hamiltonian cycles in a graph. St001772The number of occurrences of the signed pattern 12 in a signed permutation. St001863The number of weak excedances of a signed permutation. St001864The number of excedances of a signed permutation. St001867The number of alignments of type EN of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St001889The size of the connectivity set of a signed permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000456The monochromatic index of a connected graph. St001592The maximal number of simple paths between any two different vertices of a graph. St001570The minimal number of edges to add to make a graph Hamiltonian. St000878The number of ones minus the number of zeros of a binary word. St001060The distinguishing index of a graph. St001118The acyclic chromatic index of a graph. St000383The last part of an integer composition. St000696The number of cycles in the breakpoint graph of a permutation. St000007The number of saliances of the permutation. St000366The number of double descents of a permutation. St000441The number of successions of a permutation. St000451The length of the longest pattern of the form k 1 2. St000665The number of rafts of a permutation. St000842The breadth of a permutation. St000877The depth of the binary word interpreted as a path. St000885The number of critical steps in the Catalan decomposition of a binary word. St001115The number of even descents of a permutation. St001330The hat guessing number of a graph. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000408The number of occurrences of the pattern 4231 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. 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)$ . 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. St001137Number of simple modules that are 3-regular in the corresponding Nakayama algebra. St001335The cardinality of a minimal cycle-isolating set of a graph. St001371The length of the longest Yamanouchi prefix of a binary word. St001730The number of times the path corresponding to a binary word crosses the base line. St000056The decomposition (or block) number of a permutation. St000295The length of the border of a binary word. St000657The smallest part of an integer composition. St000694The number of affine bounded permutations that project to a given permutation. St000701The protection number of a binary tree. St000788The number of nesting-similar perfect matchings of a perfect matching. St000805The number of peaks of the associated bargraph. St000816The number of standard composition tableaux of the composition. St000905The number of different multiplicities of parts of an integer composition. St001041The depth of the label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001043The depth of the leaf closest to the root in the binary unordered tree associated with the perfect matching. St001174The Gorenstein dimension of the algebra

$A/I$ when

$I$ is the tilting module corresponding to the permutation in the Auslander algebra of

$K[x]/(x^n)$ . St001260The permanent of an alternating sign matrix. St001267The length of the Lyndon factorization of the binary word. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001437The flex of a binary word. St001461The number of topologically connected components of the chord diagram of a permutation. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001590The crossing number of a perfect matching. St001765The number of connected components of the friends and strangers graph. St001768The number of reduced words of a signed permutation. St001830The chord expansion number of a perfect matching. St001832The number of non-crossing perfect matchings in the chord expansion of a perfect matching. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001884The number of borders of a binary word. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000221The number of strong fixed points of a permutation. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000310The minimal degree of a vertex of a graph. St000315The number of isolated vertices of a graph. St000322The skewness of a graph. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length

$3$ . St000422The energy of a graph, if it is integral. St000454The largest eigenvalue of a graph if it is integral. St000629The defect of a binary word. St000666The number of right tethers of a permutation. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000787The number of flips required to make a perfect matching noncrossing. St000807The sum of the heights of the valleys of the associated bargraph. St000876The number of factors in the Catalan decomposition of a binary word. St000894The trace of an alternating sign matrix. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. St001131The number of trivial trees on the path to label one in the decreasing labelled binary unordered tree associated with the perfect matching. St001133The smallest label in the subtree rooted at the sister of 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series

$L=[c_0,c_1,...,c_{n−1}]$ such that

$n=c_0 < c_i$ for all

$i > 0$ a special CNakayama algebra. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001381The fertility of a permutation. St001429The number of negative entries in a signed permutation. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001444The rank of the skew-symmetric form which is non-zero on crossing arcs of a perfect matching. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001524The degree of symmetry of a binary word. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001552The number of inversions between excedances and fixed points of a permutation. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001810The number of fixed points of a permutation smaller than its largest moved point. St001811The Castelnuovo-Mumford regularity of a permutation. St001831The multiplicity of the non-nesting perfect matching in the chord expansion of a perfect matching. St001837The number of occurrences of a 312 pattern in the restricted growth word of a perfect matching. St001850The number of Hecke atoms of a permutation. St000822The Hadwiger number of the graph. St000655The length of the minimal rise of a Dyck path. St000445The number of rises of length 1 of a Dyck path. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001172The number of 1-rises at odd height of a Dyck path. St001584The area statistic between a Dyck path and its bounce path. St001651The Frankl number of a lattice. St001927Sparre Andersen's number of positives of a signed permutation. St001613The binary logarithm of the size of the center of a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices.