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
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000548: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000548: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> []
=> 0
[1,0,1,0]
=> [1]
=> 1
[1,1,0,0]
=> []
=> 0
[1,0,1,0,1,0]
=> [2,1]
=> 3
[1,0,1,1,0,0]
=> [1,1]
=> 2
[1,1,0,0,1,0]
=> [2]
=> 1
[1,1,0,1,0,0]
=> [1]
=> 1
[1,1,1,0,0,0]
=> []
=> 0
[1,0,1,0,1,0,1,0]
=> [3,2,1]
=> 6
[1,0,1,0,1,1,0,0]
=> [2,2,1]
=> 5
[1,0,1,1,0,0,1,0]
=> [3,1,1]
=> 5
[1,0,1,1,0,1,0,0]
=> [2,1,1]
=> 4
[1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 3
[1,1,0,0,1,0,1,0]
=> [3,2]
=> 3
[1,1,0,0,1,1,0,0]
=> [2,2]
=> 2
[1,1,0,1,0,0,1,0]
=> [3,1]
=> 3
[1,1,0,1,0,1,0,0]
=> [2,1]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,1]
=> 2
[1,1,1,0,0,0,1,0]
=> [3]
=> 1
[1,1,1,0,0,1,0,0]
=> [2]
=> 1
[1,1,1,0,1,0,0,0]
=> [1]
=> 1
[1,1,1,1,0,0,0,0]
=> []
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [4,3,2,1]
=> 10
[1,0,1,0,1,0,1,1,0,0]
=> [3,3,2,1]
=> 9
[1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> 9
[1,0,1,0,1,1,0,1,0,0]
=> [3,2,2,1]
=> 8
[1,0,1,0,1,1,1,0,0,0]
=> [2,2,2,1]
=> 7
[1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> 9
[1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> 8
[1,0,1,1,0,1,0,0,1,0]
=> [4,2,1,1]
=> 8
[1,0,1,1,0,1,0,1,0,0]
=> [3,2,1,1]
=> 7
[1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> 6
[1,0,1,1,1,0,0,0,1,0]
=> [4,1,1,1]
=> 7
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,1,1]
=> 6
[1,0,1,1,1,0,1,0,0,0]
=> [2,1,1,1]
=> 5
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [4,3,2]
=> 7
[1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> 5
[1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [4,3,1]
=> 6
[1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> 5
[1,1,0,1,0,1,0,0,1,0]
=> [4,2,1]
=> 7
[1,1,0,1,0,1,0,1,0,0]
=> [3,2,1]
=> 6
[1,1,0,1,0,1,1,0,0,0]
=> [2,2,1]
=> 5
[1,1,0,1,1,0,0,0,1,0]
=> [4,1,1]
=> 5
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> 5
[1,1,0,1,1,0,1,0,0,0]
=> [2,1,1]
=> 4
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1]
=> 3
Description
The number of different non-empty partial sums of an integer partition.
Matching statistic: St001232
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —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: 15%
Mp00231: Integer compositions —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: 15%
Values
[1,0]
=> [1] => [1,0]
=> [1,0]
=> 0
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> [1,0,1,0]
=> 1
[1,1,0,0]
=> [2] => [1,1,0,0]
=> [1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> ? = 3
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 2
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> ? = 6
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> ? = 5
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> ? = 5
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> ? = 4
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> ? = 3
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> ? = 3
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> ? = 3
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> ? = 10
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ? = 9
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ? = 9
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ? = 8
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ? = 7
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ? = 9
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ? = 8
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ? = 8
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ? = 7
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ? = 6
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ? = 7
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ? = 6
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ? = 5
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ? = 7
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ? = 5
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ? = 4
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ? = 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ? = 6
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ? = 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ? = 7
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ? = 6
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ? = 5
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ? = 5
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ? = 5
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ? = 4
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,0,0,1,1,0,0]
=> [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,1,1,0,0,1,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,0,1,0,1,0,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,0,1,1,0,0,0]
=> [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,1,0,0,1,0,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,1,0,1,0,0,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,1,1,0,0,0,0]
=> [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,1,1,1,0,0,0,0,1,0]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,1,1,0,0,0,1,0,0]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,1,1,0,0,1,0,0,0]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,1,1,0,1,0,0,0,0]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,1,1,1,0,0,0,0,0]
=> [5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,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]
=> ? = 15
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 14
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> ? = 14
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> ? = 13
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> ? = 12
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> ? = 14
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> ? = 13
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> ? = 13
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> ? = 12
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> ? = 11
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> ? = 12
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,5] => [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
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,4] => [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
[1,1,0,1,1,1,1,0,0,0,0,0]
=> [2,4] => [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
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [3,3] => [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
[1,1,1,0,0,1,1,1,0,0,0,0]
=> [3,3] => [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
[1,1,1,0,1,1,1,0,0,0,0,0]
=> [3,3] => [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
[1,1,1,1,0,0,0,0,1,1,0,0]
=> [4,2] => [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
[1,1,1,1,0,0,0,1,1,0,0,0]
=> [4,2] => [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
[1,1,1,1,0,0,1,1,0,0,0,0]
=> [4,2] => [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
[1,1,1,1,0,1,1,0,0,0,0,0]
=> [4,2] => [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
[1,1,1,1,1,0,0,0,0,0,1,0]
=> [5,1] => [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,1,0,0,0,0,1,0,0]
=> [5,1] => [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,1,0,0,0,1,0,0,0]
=> [5,1] => [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,1,0,0,1,0,0,0,0]
=> [5,1] => [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,1,0,1,0,0,0,0,0]
=> [5,1] => [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,1,1,0,0,0,0,0,0]
=> [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,6] => [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
[1,1,0,0,1,1,1,1,1,0,0,0,0,0]
=> [2,5] => [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
[1,1,0,1,1,1,1,1,0,0,0,0,0,0]
=> [2,5] => [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
[1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [3,4] => [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
[1,1,1,0,0,1,1,1,1,0,0,0,0,0]
=> [3,4] => [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
[1,1,1,0,1,1,1,1,0,0,0,0,0,0]
=> [3,4] => [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
[1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [4,3] => [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
[1,1,1,1,0,0,0,1,1,1,0,0,0,0]
=> [4,3] => [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
[1,1,1,1,0,0,1,1,1,0,0,0,0,0]
=> [4,3] => [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
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!