searching the database
Your data matches 2 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000548
St000548: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> 1
[2]
=> 1
[1,1]
=> 2
[3]
=> 1
[2,1]
=> 3
[1,1,1]
=> 3
[4]
=> 1
[3,1]
=> 3
[2,2]
=> 2
[2,1,1]
=> 4
[1,1,1,1]
=> 4
[5]
=> 1
[4,1]
=> 3
[3,2]
=> 3
[3,1,1]
=> 5
[2,2,1]
=> 5
[2,1,1,1]
=> 5
[1,1,1,1,1]
=> 5
[6]
=> 1
[5,1]
=> 3
[4,2]
=> 3
[4,1,1]
=> 5
[3,3]
=> 2
[3,2,1]
=> 6
[3,1,1,1]
=> 6
[2,2,2]
=> 3
[2,2,1,1]
=> 6
[2,1,1,1,1]
=> 6
[1,1,1,1,1,1]
=> 6
[7]
=> 1
[6,1]
=> 3
[5,2]
=> 3
[5,1,1]
=> 5
[4,3]
=> 3
[4,2,1]
=> 7
[4,1,1,1]
=> 7
[3,3,1]
=> 5
[3,2,2]
=> 5
[3,2,1,1]
=> 7
[3,1,1,1,1]
=> 7
[2,2,2,1]
=> 7
[2,2,1,1,1]
=> 7
[2,1,1,1,1,1]
=> 7
[1,1,1,1,1,1,1]
=> 7
[8]
=> 1
[7,1]
=> 3
[6,2]
=> 3
[6,1,1]
=> 5
[5,3]
=> 3
[5,2,1]
=> 7
Description
The number of different non-empty partial sums of an integer partition.
Matching statistic: St001232
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 5% ●values known / values provided: 5%●distinct values known / distinct values provided: 13%
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 5% ●values known / values provided: 5%●distinct values known / distinct values provided: 13%
Values
[1]
=> [1,0,1,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
[2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 1
[1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 2
[3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[2,1]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> ? = 3
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> ? = 3
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> ? = 4
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ? = 3
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> ? = 3
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> ? = 5
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> ? = 5
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ? = 5
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 5
[6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 1
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> ? = 3
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ? = 3
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ? = 5
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> ? = 6
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ? = 6
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ? = 6
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> ? = 6
[1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> 6
[7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 1
[6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> ? = 3
[5,2]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> ? = 3
[5,1,1]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> ? = 5
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ? = 7
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ? = 7
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ? = 5
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ? = 5
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ? = 7
[3,1,1,1,1]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> ? = 7
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ? = 7
[2,2,1,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> ? = 7
[2,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,1,0,0,0,0,0]
=> ? = 7
[1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0]
=> ? = 7
[8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> ? = 1
[7,1]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0,1,0]
=> ? = 3
[6,2]
=> [1,1,1,1,1,0,0,1,0,0,0,0,1,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0,1,0]
=> ? = 3
[6,1,1]
=> [1,1,1,1,0,1,1,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> ? = 5
[5,3]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> ? = 3
[5,2,1]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> ? = 7
[5,1,1,1]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> ? = 7
[4,4]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ? = 6
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ? = 4
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ? = 8
[4,1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> ? = 8
[3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ? = 5
[3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ? = 8
[3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ? = 8
[3,2,1,1,1]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> ? = 8
[3,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,1,0,0,0,0]
=> ? = 8
[2,2,2,2]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 4
[2,2,2,1,1]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> ? = 8
[2,2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,1,0,0,0,0,0]
=> ? = 8
[2,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> [1,0,1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0]
=> ? = 8
[1,1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0]
=> ? = 8
[3,3,3]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 3
[5,5]
=> [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> 2
[2,2,2,2,2]
=> [1,1,0,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> 5
[4,4,4]
=> [1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> 3
[3,3,3,3]
=> [1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> 4
Description
The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!