Your data matches 2 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001918: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> 0
[2]
=> 1
[1,1]
=> 0
[3]
=> 2
[2,1]
=> 1
[1,1,1]
=> 0
[4]
=> 3
[3,1]
=> 2
[2,2]
=> 1
[2,1,1]
=> 1
[1,1,1,1]
=> 0
[5]
=> 4
[4,1]
=> 3
[3,2]
=> 4
[3,1,1]
=> 2
[2,2,1]
=> 1
[2,1,1,1]
=> 1
[1,1,1,1,1]
=> 0
[6]
=> 5
[5,1]
=> 4
[4,2]
=> 3
[4,1,1]
=> 3
[3,3]
=> 2
[3,2,1]
=> 4
[3,1,1,1]
=> 2
[2,2,2]
=> 1
[2,2,1,1]
=> 1
[2,1,1,1,1]
=> 1
[1,1,1,1,1,1]
=> 0
[7]
=> 6
[6,1]
=> 5
[5,2]
=> 8
[5,1,1]
=> 4
[4,3]
=> 9
[4,2,1]
=> 3
[4,1,1,1]
=> 3
[3,3,1]
=> 2
[3,2,2]
=> 4
[3,2,1,1]
=> 4
[3,1,1,1,1]
=> 2
[2,2,2,1]
=> 1
[2,2,1,1,1]
=> 1
[2,1,1,1,1,1]
=> 1
[1,1,1,1,1,1,1]
=> 0
[8]
=> 7
[7,1]
=> 6
[6,2]
=> 5
[6,1,1]
=> 5
[5,3]
=> 12
[5,2,1]
=> 8
Description
The degree of the cyclic sieving polynomial corresponding to an integer partition. Let $\lambda$ be an integer partition of $n$ and let $N$ be the least common multiple of the parts of $\lambda$. Fix an arbitrary permutation $\pi$ of cycle type $\lambda$. Then $\pi$ induces a cyclic action of order $N$ on $\{1,\dots,n\}$. The corresponding character can be identified with the cyclic sieving polynomial $C_\lambda(q)$ of this action, modulo $q^N-1$. Explicitly, it is $$ \sum_{p\in\lambda} [p]_{q^{N/p}}, $$ where $[p]_q = 1+\dots+q^{p-1}$ is the $q$-integer. This statistic records the degree of $C_\lambda(q)$. Equivalently, it equals $$ \left(1 - \frac{1}{\lambda_1}\right) N, $$ where $\lambda_1$ is the largest part of $\lambda$. The statistic is undefined for the empty partition.
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00143: Dyck paths inverse promotionDyck paths
Mp00101: Dyck paths decomposition reverseDyck paths
St001232: Dyck paths ⟶ ℤResult quality: 2% values known / values provided: 2%distinct values known / distinct values provided: 16%
Values
[1]
=> [1,0]
=> [1,0]
=> [1,0]
=> 0
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
[3]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 2
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ? = 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 3
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> ? = 2
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> ? = 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 4
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> ? = 3
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ? = 4
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> ? = 2
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> ? = 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 5
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> ? = 4
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> ? = 3
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> ? = 3
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> ? = 4
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> ? = 2
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> ? = 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> ? = 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> ? = 5
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> ? = 8
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,1,0,1,1,0,0,0,0,0]
=> ? = 4
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> ? = 9
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> ? = 3
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,0]
=> ? = 3
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> ? = 4
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> ? = 4
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,1,1,0,0,0,0,0]
=> ? = 2
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ? = 1
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> ? = 1
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 0
[8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? = 7
[7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> ? = 6
[6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,1,0,1,0,0,0,0]
=> ? = 5
[6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> ? = 5
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> ? = 12
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,1,0,0,0]
=> ? = 8
[5,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> ? = 4
[4,4]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 3
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> ? = 9
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> ? = 3
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,1,0,0]
=> ? = 3
[4,1,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,1,1,1,0,0,0,0,0,0]
=> ? = 3
[3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ? = 4
[3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> 2
[3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 4
[3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 4
[3,1,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 2
[2,2,2,2]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> ? = 1
[2,2,2,1,1]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 1
[2,2,1,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 1
[2,1,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,1,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,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
[9]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 8
[8,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0]
=> ? = 7
[7,2]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,1,0,1,0,1,0,0,0,0,0]
=> ? = 12
[7,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0]
=> ? = 6
[6,3]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,0]
=> ? = 5
[6,2,1]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,1,0,1,1,0,0,1,0,0,0,0]
=> ? = 5
[4,4,1]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 3
[3,3,1,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> 2
[5,5]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 4
[4,4,1,1]
=> [1,1,1,0,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> 3
[5,5,1]
=> [1,1,1,0,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> 4
[6,6]
=> [1,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,1,1,0,0,0,0,0]
=> 5
Description
The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.