Your data matches 3 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000932
Mapping
Mp00275: Graphs —to edge-partition of connected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St000932: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
([(1,2)],3)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
([(0,2),(1,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 1
([(0,1),(0,2),(1,2)],3)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(2,3)],4)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
([(1,3),(2,3)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 1
([(0,3),(1,3),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(0,3),(1,2)],4)
 => [1,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 0
([(0,3),(1,2),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(1,2),(1,3),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(3,4)],5)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
([(2,4),(3,4)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 1
([(1,4),(2,4),(3,4)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(1,4),(2,3)],5)
 => [1,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 0
([(1,4),(2,3),(3,4)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(0,1),(2,4),(3,4)],5)
 => [2,1]
 => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => 0
([(2,3),(2,4),(3,4)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(0,4),(1,4),(2,3),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(1,3),(1,4),(2,3),(2,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => [3,1]
 => [1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(4,5)],6)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
([(3,5),(4,5)],6)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 1
([(2,5),(3,5),(4,5)],6)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(1,5),(2,5),(3,5),(4,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(2,5),(3,4)],6)
 => [1,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 0
([(2,5),(3,4),(4,5)],6)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(1,2),(3,5),(4,5)],6)
 => [2,1]
 => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => 0
([(3,4),(3,5),(4,5)],6)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(1,5),(2,5),(3,4),(4,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,1),(2,5),(3,5),(4,5)],6)
 => [3,1]
 => [1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 2
([(2,5),(3,4),(3,5),(4,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(2,4),(2,5),(3,4),(3,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,5),(1,5),(2,4),(3,4)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
Description
The number of occurrences of the pattern UDU in a Dyck path. The number of Dyck paths with statistic value 0 are counted by the Motzkin numbers [1].
Matching statistic: St001067
Mapping
Mp00275: Graphs —to edge-partition of connected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001067: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
([(1,2)],3)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
([(0,2),(1,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 1
([(0,1),(0,2),(1,2)],3)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(2,3)],4)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
([(1,3),(2,3)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 1
([(0,3),(1,3),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(0,3),(1,2)],4)
 => [1,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 0
([(0,3),(1,2),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(1,2),(1,3),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(3,4)],5)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
([(2,4),(3,4)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 1
([(1,4),(2,4),(3,4)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(1,4),(2,3)],5)
 => [1,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 0
([(1,4),(2,3),(3,4)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(0,1),(2,4),(3,4)],5)
 => [2,1]
 => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => 0
([(2,3),(2,4),(3,4)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(0,4),(1,4),(2,3),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(1,3),(1,4),(2,3),(2,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => [3,1]
 => [1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(4,5)],6)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
([(3,5),(4,5)],6)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 1
([(2,5),(3,5),(4,5)],6)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(1,5),(2,5),(3,5),(4,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(2,5),(3,4)],6)
 => [1,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 0
([(2,5),(3,4),(4,5)],6)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(1,2),(3,5),(4,5)],6)
 => [2,1]
 => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => 0
([(3,4),(3,5),(4,5)],6)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(1,5),(2,5),(3,4),(4,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,1),(2,5),(3,5),(4,5)],6)
 => [3,1]
 => [1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 2
([(2,5),(3,4),(3,5),(4,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(2,4),(2,5),(3,4),(3,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,5),(1,5),(2,4),(3,4)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
Description
The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra.
Matching statistic: St001223
Mapping
Mp00275: Graphs —to edge-partition of connected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001223: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
([(1,2)],3)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
([(0,2),(1,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 1
([(0,1),(0,2),(1,2)],3)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(2,3)],4)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
([(1,3),(2,3)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 1
([(0,3),(1,3),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(0,3),(1,2)],4)
 => [1,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 0
([(0,3),(1,2),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(1,2),(1,3),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(3,4)],5)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
([(2,4),(3,4)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 1
([(1,4),(2,4),(3,4)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(1,4),(2,3)],5)
 => [1,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 0
([(1,4),(2,3),(3,4)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(0,1),(2,4),(3,4)],5)
 => [2,1]
 => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => 0
([(2,3),(2,4),(3,4)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(0,4),(1,4),(2,3),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(1,3),(1,4),(2,3),(2,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => [3,1]
 => [1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(4,5)],6)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
([(3,5),(4,5)],6)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 1
([(2,5),(3,5),(4,5)],6)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(1,5),(2,5),(3,5),(4,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(2,5),(3,4)],6)
 => [1,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 0
([(2,5),(3,4),(4,5)],6)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(1,2),(3,5),(4,5)],6)
 => [2,1]
 => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => 0
([(3,4),(3,5),(4,5)],6)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(1,5),(2,5),(3,4),(4,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,1),(2,5),(3,5),(4,5)],6)
 => [3,1]
 => [1,1,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 2
([(2,5),(3,4),(3,5),(4,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(2,4),(2,5),(3,4),(3,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 2
([(0,5),(1,5),(2,4),(3,4)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 2
Description
Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless.