Your data matches 42 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Mp00028: Dyck paths reverseDyck paths
St001066: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> 1
[1,0,1,0]
=> [1,0,1,0]
=> 1
[1,1,0,0]
=> [1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
Description
The number of simple reflexive modules in the corresponding Nakayama algebra.
Mp00102: Dyck paths rise compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St001483: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> 1
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 1
[1,1,0,0]
=> [2] => [1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [3,1] => [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,1,0,1,0,0,0]
=> [3,1] => [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,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 3
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2
[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,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2
[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,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[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,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[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,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[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,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[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,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[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,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[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,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1
Description
The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module.
Mp00120: Dyck paths Lalanne-Kreweras involutionDyck paths
Mp00029: Dyck paths to binary tree: left tree, up step, right tree, down stepBinary trees
St000118: Binary trees ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [.,.]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,0]
=> [.,[.,.]]
=> 0 = 1 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [[.,.],.]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [.,[.,[.,.]]]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [[.,[.,.]],.]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [[.,.],[.,.]]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [.,[[.,.],.]]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [[[.,.],.],.]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [.,[.,[.,[.,.]]]]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [[.,[.,[.,.]]],.]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [[.,[.,.]],[.,.]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [.,[[.,[.,.]],.]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [[[.,[.,.]],.],.]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [[.,.],[.,[.,.]]]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [[[.,.],[.,.]],.]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [.,[[.,.],[.,.]]]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [.,[.,[[.,.],.]]]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [[.,[[.,.],.]],.]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [[[.,.],.],[.,.]]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [[.,.],[[.,.],.]]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [.,[[[.,.],.],.]]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [[[[.,.],.],.],.]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [.,[.,[.,[.,[.,.]]]]]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [[.,[.,[.,[.,.]]]],.]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [[.,[.,[.,.]]],[.,.]]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [.,[[.,[.,[.,.]]],.]]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [[[.,[.,[.,.]]],.],.]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [[.,[.,.]],[.,[.,.]]]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [[[.,[.,.]],[.,.]],.]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [.,[[.,[.,.]],[.,.]]]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [.,[.,[[.,[.,.]],.]]]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [[.,[[.,[.,.]],.]],.]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [[[.,[.,.]],.],[.,.]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [[.,[.,.]],[[.,.],.]]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [.,[[[.,[.,.]],.],.]]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [[[[.,[.,.]],.],.],.]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [[.,.],[.,[.,[.,.]]]]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [[[.,.],[.,[.,.]]],.]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [[[.,.],[.,.]],[.,.]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [[.,.],[[.,[.,.]],.]]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [[[[.,.],[.,.]],.],.]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [.,[[.,.],[.,[.,.]]]]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [[.,[[.,.],[.,.]]],.]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [.,[.,[[.,.],[.,.]]]]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [.,[.,[.,[[.,.],.]]]]
=> 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [[.,[.,[[.,.],.]]],.]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [[.,[[.,.],.]],[.,.]]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [.,[[[.,.],[.,.]],.]]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [.,[[.,[[.,.],.]],.]]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [[[.,[[.,.],.]],.],.]
=> 0 = 1 - 1
Description
The number of occurrences of the contiguous pattern {{{[.,[.,[.,.]]]}}} in a binary tree. [[oeis:A001006]] counts binary trees avoiding this pattern.
Mp00102: Dyck paths rise compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St001167: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [2] => [1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[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]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[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 = 2 - 1
[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 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[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 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[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 = 2 - 1
[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 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
Description
The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. The top of a module is the cokernel of the inclusion of the radical of the module into the module. For Nakayama algebras with at most 8 simple modules, the statistic also coincides with the number of simple modules with projective dimension at least 3 in the corresponding Nakayama algebra.
Mp00102: Dyck paths rise compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St001253: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [2] => [1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[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]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[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 = 2 - 1
[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 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[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 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[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 = 2 - 1
[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 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
Description
The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. For the first 196 values the statistic coincides also with the number of fixed points of $\tau \Omega^2$ composed with its inverse, see theorem 5.8. in the reference for more details. The number of Dyck paths of length n where the statistics returns zero seems to be 2^(n-1).
Matching statistic: St000776
Mp00102: Dyck paths rise compositionInteger compositions
Mp00184: Integer compositions to threshold graphGraphs
Mp00247: Graphs de-duplicateGraphs
St000776: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 1
[1,0,1,0]
=> [1,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,0,0]
=> [2] => ([],2)
=> ([],1)
=> 1
[1,0,1,0,1,0]
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
[1,0,1,1,0,0]
=> [1,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,0,1,0,0]
=> [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,1,0,0,0]
=> [3] => ([],3)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,0,1,0,1,1,0,0]
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
[1,0,1,1,0,0,1,0]
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> [1,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
[1,1,0,0,1,1,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
[1,1,0,1,0,1,0,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
[1,1,0,1,1,0,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1
[1,1,1,0,0,0,1,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,1,0,1,0,0,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,1,1,0,0,0,0]
=> [4] => ([],4)
=> ([],1)
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1
Description
The maximal multiplicity of an eigenvalue in a graph.
Matching statistic: St000052
Mp00102: Dyck paths rise compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
Mp00229: Dyck paths Delest-ViennotDyck paths
St000052: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [2] => [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[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,1,0,1,0,1,0,1,0,0]
=> 3 = 4 - 1
[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,0,1,0]
=> 2 = 3 - 1
[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,0,1,1,0,0]
=> 1 = 2 - 1
[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,0,1,1,0,0]
=> 1 = 2 - 1
[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,0,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[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,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[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,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[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,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[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,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[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,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[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,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[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,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[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,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[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,0,1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[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,0,1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[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,0,1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[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,0,1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
Description
The number of valleys of a Dyck path not on the x-axis. That is, the number of valleys of nonminimal height. This corresponds to the number of -1's in an inclusion of Dyck paths into alternating sign matrices.
Mp00102: Dyck paths rise compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
Mp00229: Dyck paths Delest-ViennotDyck paths
St001172: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [2] => [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[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,1,0,1,0,1,0,1,0,0]
=> 3 = 4 - 1
[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,0,1,0]
=> 2 = 3 - 1
[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,0,1,1,0,0]
=> 1 = 2 - 1
[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,0,1,1,0,0]
=> 1 = 2 - 1
[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,0,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[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,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[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,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[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,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[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,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[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,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[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,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[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,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[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,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[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,0,1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[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,0,1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[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,0,1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[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,0,1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
Description
The number of 1-rises at odd height of a Dyck path.
Mp00028: Dyck paths reverseDyck paths
Mp00120: Dyck paths Lalanne-Kreweras involutionDyck paths
St000931: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> ? = 1 - 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
Description
The number of occurrences of the pattern UUU in a Dyck path. The number of Dyck paths with statistic value 0 are counted by the Motzkin numbers [1].
Mp00120: Dyck paths Lalanne-Kreweras involutionDyck paths
Mp00137: Dyck paths to symmetric ASMAlternating sign matrices
Mp00002: Alternating sign matrices to left key permutationPermutations
St000366: Permutations ⟶ ℤResult quality: 78% values known / values provided: 78%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [[1]]
=> [1] => 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => 0 = 1 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [[0,0,1],[0,1,0],[1,0,0]]
=> [3,2,1] => 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => 0 = 1 - 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [1,3,2] => 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]]
=> [4,3,2,1] => 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[0,1,0,0],[1,0,0,0],[0,0,0,1]]
=> [3,2,1,4] => 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [2,1,4,3] => 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[0,1,0,0],[1,0,-1,1],[0,0,1,0]]
=> [2,1,4,3] => 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [2,1,3,4] => 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]]
=> [1,4,3,2] => 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,0,1,0],[0,1,0,0]]
=> [1,4,3,2] => 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[0,1,-1,1],[1,-1,1,0],[0,1,0,0]]
=> [1,4,3,2] => 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [1,2,4,3] => 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[1,0,0,0,0]]
=> [5,4,3,2,1] => 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1]]
=> [4,3,2,1,5] => 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [[0,0,1,0,0],[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [3,2,1,5,4] => 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [3,2,1,5,4] => 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [[0,0,1,0,0],[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [3,2,1,4,5] => 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [[0,0,1,0,0],[0,1,0,0,0],[1,0,-1,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [[0,0,0,1,0],[0,0,1,0,0],[0,1,0,-1,1],[1,0,-1,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [[0,0,1,0,0],[0,1,0,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [[0,0,1,0,0],[0,1,0,0,0],[1,0,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,1,3,4,5] => 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,5,4,3,2] => 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,4,3,2,5] => 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,5,4,3,2] => 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,4,3,2,5] => 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [[0,0,1,0,0],[0,1,-1,0,1],[1,-1,0,1,0],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,5,4,3,2] => 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [[0,0,0,1,0],[0,0,1,-1,1],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,0,0,0]]
=> [1,5,4,3,2] => 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,4,3,2,5] => 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,0,0,1],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0]]
=> [4,3,2,1,7,6,5] => ? = 4 - 1
[1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> [[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0],[0,0,0,0,0,0,1]]
=> [4,3,2,1,6,5,7] => ? = 3 - 1
[1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,1,0,0,0]
=> [[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,-1,0,1],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0]]
=> [4,3,2,1,7,6,5] => ? = 4 - 1
[1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> [[0,0,0,0,0,1,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,-1,1],[1,0,0,0,-1,1,0],[0,0,0,0,1,0,0]]
=> [4,3,2,1,7,6,5] => ? = 4 - 1
[1,0,1,0,1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0]
=> [[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,-1,1,0],[0,0,0,0,1,0,0],[0,0,0,0,0,0,1]]
=> [4,3,2,1,6,5,7] => ? = 3 - 1
[1,0,1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0,1,1,0,0]
=> [[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,0,1],[0,0,0,0,0,1,0]]
=> [4,3,2,1,5,7,6] => ? = 3 - 1
[1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,1,0,1,0,0]
=> [[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> [4,3,2,1,5,7,6] => ? = 3 - 1
[1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,1,0,0]
=> [[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,-1,1,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> [4,3,2,1,5,7,6] => ? = 3 - 1
[1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,0,0,1],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0]]
=> [3,2,1,7,6,5,4] => ? = 4 - 1
[1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0,1,0]
=> [[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,0,0,0,0,1]]
=> [3,2,1,6,5,4,7] => ? = 3 - 1
[1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0,1,1,0,0]
=> [[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,0,0,0,0,1],[0,0,0,0,0,1,0]]
=> [3,2,1,5,4,7,6] => ? = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,1,0,0]
=> [[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0],[0,0,0,1,0,-1,1],[0,0,0,0,0,1,0]]
=> [3,2,1,5,4,7,6] => ? = 2 - 1
[1,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0,1,0]
=> [[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,0,0,1]]
=> [3,2,1,5,4,6,7] => ? = 2 - 1
[1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,1,1,0,0,0,0]
=> [[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,-1,0,0,1],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0]]
=> [3,2,1,7,6,5,4] => ? = 4 - 1
[1,0,1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0,1,0]
=> [[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,-1,0,1,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,0,0,0,0,1]]
=> [3,2,1,6,5,4,7] => ? = 3 - 1
[1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,1,1,0,0,0,1,1,0,0,0,0]
=> [[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,-1,0,1],[1,0,0,-1,0,1,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0]]
=> [3,2,1,7,6,5,4] => ? = 4 - 1
[1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> [[0,0,0,0,0,1,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,-1,1],[0,1,0,0,-1,1,0],[1,0,0,-1,1,0,0],[0,0,0,1,0,0,0]]
=> [3,2,1,7,6,5,4] => ? = 4 - 1
[1,0,1,0,1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0,1,0]
=> [[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,-1,1,0],[1,0,0,-1,1,0,0],[0,0,0,1,0,0,0],[0,0,0,0,0,0,1]]
=> [3,2,1,6,5,4,7] => ? = 3 - 1
[1,0,1,0,1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0,1,1,0,0]
=> [[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,-1,1,0,0],[0,0,0,1,0,0,0],[0,0,0,0,0,0,1],[0,0,0,0,0,1,0]]
=> [3,2,1,5,4,7,6] => ? = 2 - 1
[1,0,1,0,1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> [[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,-1,0,1,0],[0,0,0,0,1,0,0],[0,0,0,1,0,-1,1],[0,0,0,0,0,1,0]]
=> [3,2,1,5,4,7,6] => ? = 2 - 1
[1,0,1,0,1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,1,0,0]
=> [[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,-1,1,0],[1,0,0,-1,1,0,0],[0,0,0,1,0,-1,1],[0,0,0,0,0,1,0]]
=> [3,2,1,5,4,7,6] => ? = 2 - 1
[1,0,1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0,1,0]
=> [[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,-1,1,0,0],[0,0,0,1,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,0,0,1]]
=> [3,2,1,5,4,6,7] => ? = 2 - 1
[1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,1,1,0,0,0]
=> [[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,0,0,0,0,1],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0]]
=> [3,2,1,4,7,6,5] => ? = 3 - 1
[1,0,1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0,1,0]
=> [[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0],[0,0,0,0,0,0,1]]
=> [3,2,1,4,6,5,7] => ? = 2 - 1
[1,0,1,0,1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,1,1,0,0,0]
=> [[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,1,-1,0,1],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0]]
=> [3,2,1,4,7,6,5] => ? = 3 - 1
[1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,1,0,1,0,0,0]
=> [[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,1,-1,1],[0,0,0,1,-1,1,0],[0,0,0,0,1,0,0]]
=> [3,2,1,4,7,6,5] => ? = 3 - 1
[1,0,1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,1,0,0,1,0]
=> [[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,1,-1,1,0],[0,0,0,0,1,0,0],[0,0,0,0,0,0,1]]
=> [3,2,1,4,6,5,7] => ? = 2 - 1
[1,0,1,0,1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> [[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,-1,1,0,0],[0,0,0,1,-1,0,1],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0]]
=> [3,2,1,4,7,6,5] => ? = 3 - 1
[1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,1,0,0,0]
=> [[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,-1,0,1,0],[0,0,0,0,1,-1,1],[0,0,0,1,-1,1,0],[0,0,0,0,1,0,0]]
=> [3,2,1,4,7,6,5] => ? = 3 - 1
[1,0,1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,1,0,0,0]
=> [[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,-1,1,0],[1,0,0,-1,1,-1,1],[0,0,0,1,-1,1,0],[0,0,0,0,1,0,0]]
=> [3,2,1,4,7,6,5] => ? = 3 - 1
[1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0,1,0]
=> [[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,-1,1,0,0],[0,0,0,1,-1,1,0],[0,0,0,0,1,0,0],[0,0,0,0,0,0,1]]
=> [3,2,1,4,6,5,7] => ? = 2 - 1
[1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0,1,1,0,0]
=> [[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,0,1],[0,0,0,0,0,1,0]]
=> [3,2,1,4,5,7,6] => ? = 2 - 1
[1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,1,0,1,0,0]
=> [[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> [3,2,1,4,5,7,6] => ? = 2 - 1
[1,0,1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,1,0,1,0,0]
=> [[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,1,-1,1,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> [3,2,1,4,5,7,6] => ? = 2 - 1
[1,0,1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> [[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,-1,1,0,0],[0,0,0,1,-1,1,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> [3,2,1,4,5,7,6] => ? = 2 - 1
[1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0,1,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,0,0,0,0,0,1]]
=> [2,1,6,5,4,3,7] => ? = 3 - 1
[1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,1,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,0,0,0,0,0,1],[0,0,0,0,0,1,0]]
=> [2,1,5,4,3,7,6] => ? = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,1,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,-1,1],[0,0,0,0,0,1,0]]
=> [2,1,5,4,3,7,6] => ? = 2 - 1
[1,0,1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0,1,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,0,0,1]]
=> [2,1,5,4,3,6,7] => ? = 2 - 1
[1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,0,0,0,0,0,1],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0]]
=> [2,1,4,3,7,6,5] => ? = 2 - 1
[1,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0],[0,0,0,0,0,0,1]]
=> [2,1,4,3,6,5,7] => ? = 1 - 1
[1,0,1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,1,1,0,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,-1,0,1],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0]]
=> [2,1,4,3,7,6,5] => ? = 2 - 1
[1,0,1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,1,0,0,1,0,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0],[0,0,0,1,0,-1,1],[0,0,1,0,-1,1,0],[0,0,0,0,1,0,0]]
=> [2,1,4,3,7,6,5] => ? = 2 - 1
[1,0,1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0,1,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,-1,1,0],[0,0,0,0,1,0,0],[0,0,0,0,0,0,1]]
=> [2,1,4,3,6,5,7] => ? = 1 - 1
[1,0,1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,0,1],[0,0,0,0,0,1,0]]
=> [2,1,4,3,5,7,6] => ? = 1 - 1
[1,0,1,1,0,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> [2,1,4,3,5,7,6] => ? = 1 - 1
[1,0,1,1,0,0,1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,1,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,-1,1,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> [2,1,4,3,5,7,6] => ? = 1 - 1
[1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0],[0,0,0,0,0,0,1]]
=> [2,1,4,3,5,6,7] => ? = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0,1,0]
=> [[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,-1,0,0,1,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,0,0,0,0,0,1]]
=> [2,1,6,5,4,3,7] => ? = 3 - 1
[1,0,1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0,1,1,0,0]
=> [[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,-1,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,0,0,0,0,0,1],[0,0,0,0,0,1,0]]
=> [2,1,5,4,3,7,6] => ? = 2 - 1
Description
The number of double descents of a permutation. A double descent of a permutation $\pi$ is a position $i$ such that $\pi(i) > \pi(i+1) > \pi(i+2)$.
The following 32 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000358The number of occurrences of the pattern 31-2. St000365The number of double ascents of a permutation. St001727The number of invisible inversions of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St000732The number of double deficiencies of a permutation. St000836The number of descents of distance 2 of a permutation. St001484The number of singletons of an integer partition. St000731The number of double exceedences of a permutation. St000932The number of occurrences of the pattern UDU in a Dyck path. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000039The number of crossings of a permutation. St000317The cycle descent number of a permutation. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St000445The number of rises of length 1 of a Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001223Number 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. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001095The number of non-isomorphic posets with precisely one further covering relation. St001964The interval resolution global dimension of a poset. St000982The length of the longest constant subword. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001948The number of augmented double ascents of a permutation. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$.