searching the database
Your data matches 1 statistic 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: St000566
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
Mp00322: Integer partitions —Loehr-Warrington⟶ Integer partitions
St000566: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00202: Integer partitions —first row removal⟶ Integer partitions
Mp00322: Integer partitions —Loehr-Warrington⟶ Integer partitions
St000566: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],3)
=> [1,1,1]
=> [1,1]
=> [2]
=> 1
([],4)
=> [1,1,1,1]
=> [1,1,1]
=> [2,1]
=> 1
([(2,3)],4)
=> [2,1,1]
=> [1,1]
=> [2]
=> 1
([(0,3),(1,2)],4)
=> [2,2]
=> [2]
=> [1,1]
=> 0
([],5)
=> [1,1,1,1,1]
=> [1,1,1,1]
=> [3,1]
=> 3
([(3,4)],5)
=> [2,1,1,1]
=> [1,1,1]
=> [2,1]
=> 1
([(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> [2]
=> 1
([(1,4),(2,3)],5)
=> [2,2,1]
=> [2,1]
=> [3]
=> 3
([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> [1,1]
=> 0
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> [2]
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> [1,1]
=> 0
([],6)
=> [1,1,1,1,1,1]
=> [1,1,1,1,1]
=> [3,2]
=> 4
([(4,5)],6)
=> [2,1,1,1,1]
=> [1,1,1,1]
=> [3,1]
=> 3
([(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,1,1]
=> [2,1]
=> 1
([(2,5),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> [2]
=> 1
([(2,5),(3,4)],6)
=> [2,2,1,1]
=> [2,1,1]
=> [2,2]
=> 2
([(2,5),(3,4),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> [2]
=> 1
([(1,2),(3,5),(4,5)],6)
=> [3,2,1]
=> [2,1]
=> [3]
=> 3
([(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,1,1]
=> [2,1]
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [4,2]
=> [2]
=> [1,1]
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> [2]
=> 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,1]
=> [2]
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [3,3]
=> [3]
=> [1,1,1]
=> 0
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> [2]
=> 1
([(0,5),(1,4),(2,3)],6)
=> [2,2,2]
=> [2,2]
=> [4]
=> 6
([(0,1),(2,5),(3,4),(4,5)],6)
=> [4,2]
=> [2]
=> [1,1]
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [2,1]
=> [3]
=> 3
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,2]
=> [2]
=> [1,1]
=> 0
([(0,1),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,2]
=> [2]
=> [1,1]
=> 0
([(0,5),(1,5),(2,3),(2,4),(3,4)],6)
=> [3,3]
=> [3]
=> [1,1,1]
=> 0
([(0,1),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,2]
=> [2]
=> [1,1]
=> 0
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> [2]
=> 1
([(0,4),(0,5),(1,2),(1,3),(2,3),(4,5)],6)
=> [3,3]
=> [3]
=> [1,1,1]
=> 0
([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,2]
=> [2]
=> [1,1]
=> 0
([],7)
=> [1,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [3,2,1]
=> 4
([(5,6)],7)
=> [2,1,1,1,1,1]
=> [1,1,1,1,1]
=> [3,2]
=> 4
([(4,6),(5,6)],7)
=> [3,1,1,1,1]
=> [1,1,1,1]
=> [3,1]
=> 3
([(3,6),(4,6),(5,6)],7)
=> [4,1,1,1]
=> [1,1,1]
=> [2,1]
=> 1
([(2,6),(3,6),(4,6),(5,6)],7)
=> [5,1,1]
=> [1,1]
=> [2]
=> 1
([(3,6),(4,5)],7)
=> [2,2,1,1,1]
=> [2,1,1,1]
=> [3,1,1]
=> 3
([(3,6),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,1,1]
=> [2,1]
=> 1
([(2,3),(4,6),(5,6)],7)
=> [3,2,1,1]
=> [2,1,1]
=> [2,2]
=> 2
([(4,5),(4,6),(5,6)],7)
=> [3,1,1,1,1]
=> [1,1,1,1]
=> [3,1]
=> 3
([(2,6),(3,6),(4,5),(5,6)],7)
=> [5,1,1]
=> [1,1]
=> [2]
=> 1
([(1,2),(3,6),(4,6),(5,6)],7)
=> [4,2,1]
=> [2,1]
=> [3]
=> 3
([(3,6),(4,5),(4,6),(5,6)],7)
=> [4,1,1,1]
=> [1,1,1]
=> [2,1]
=> 1
([(0,1),(2,6),(3,6),(4,6),(5,6)],7)
=> [5,2]
=> [2]
=> [1,1]
=> 0
([(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,1,1]
=> [1,1]
=> [2]
=> 1
([(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,1,1]
=> [2,1]
=> 1
([(1,6),(2,6),(3,5),(4,5)],7)
=> [3,3,1]
=> [3,1]
=> [2,1,1]
=> 1
Description
The number of ways to select a row of a Ferrers shape and two cells in this row. Equivalently, if λ=(λ0≥λ1≥⋯≥λm) is an integer partition, then the statistic is
12m∑i=0λi(λi−1).
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!