- FindStat

edit this statistic or download as text // json

Identifier

St000340: Dyck paths ⟶ ℤ

Values

[1,0] => 0

[1,0,1,0] => 0

[1,1,0,0] => 1

[1,0,1,0,1,0] => 0

[1,0,1,1,0,0] => 1

[1,1,0,0,1,0] => 2

[1,1,0,1,0,0] => 1

[1,1,1,0,0,0] => 1

[1,0,1,0,1,0,1,0] => 0

[1,0,1,0,1,1,0,0] => 1

[1,0,1,1,0,0,1,0] => 2

[1,0,1,1,0,1,0,0] => 1

[1,0,1,1,1,0,0,0] => 1

[1,1,0,0,1,0,1,0] => 2

[1,1,0,0,1,1,0,0] => 3

[1,1,0,1,0,0,1,0] => 2

[1,1,0,1,0,1,0,0] => 1

[1,1,0,1,1,0,0,0] => 2

[1,1,1,0,0,0,1,0] => 2

[1,1,1,0,0,1,0,0] => 2

[1,1,1,0,1,0,0,0] => 1

[1,1,1,1,0,0,0,0] => 1

[1,0,1,0,1,0,1,0,1,0] => 0

[1,0,1,0,1,0,1,1,0,0] => 1

[1,0,1,0,1,1,0,0,1,0] => 2

[1,0,1,0,1,1,0,1,0,0] => 1

[1,0,1,0,1,1,1,0,0,0] => 1

[1,0,1,1,0,0,1,0,1,0] => 2

[1,0,1,1,0,0,1,1,0,0] => 3

[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,1,0,1,1,0,0,0] => 2

[1,0,1,1,1,0,0,0,1,0] => 2

[1,0,1,1,1,0,0,1,0,0] => 2

[1,0,1,1,1,0,1,0,0,0] => 1

[1,0,1,1,1,1,0,0,0,0] => 1

[1,1,0,0,1,0,1,0,1,0] => 2

[1,1,0,0,1,0,1,1,0,0] => 3

[1,1,0,0,1,1,0,0,1,0] => 4

[1,1,0,0,1,1,0,1,0,0] => 3

[1,1,0,0,1,1,1,0,0,0] => 3

[1,1,0,1,0,0,1,0,1,0] => 2

[1,1,0,1,0,0,1,1,0,0] => 3

[1,1,0,1,0,1,0,0,1,0] => 2

[1,1,0,1,0,1,0,1,0,0] => 1

[1,1,0,1,0,1,1,0,0,0] => 2

[1,1,0,1,1,0,0,0,1,0] => 3

[1,1,0,1,1,0,0,1,0,0] => 3

[1,1,0,1,1,0,1,0,0,0] => 2

[1,1,0,1,1,1,0,0,0,0] => 2

[1,1,1,0,0,0,1,0,1,0] => 2

[1,1,1,0,0,0,1,1,0,0] => 3

[1,1,1,0,0,1,0,0,1,0] => 3

[1,1,1,0,0,1,0,1,0,0] => 2

[1,1,1,0,0,1,1,0,0,0] => 3

[1,1,1,0,1,0,0,0,1,0] => 2

[1,1,1,0,1,0,0,1,0,0] => 2

[1,1,1,0,1,0,1,0,0,0] => 1

[1,1,1,0,1,1,0,0,0,0] => 2

[1,1,1,1,0,0,0,0,1,0] => 2

[1,1,1,1,0,0,0,1,0,0] => 2

[1,1,1,1,0,0,1,0,0,0] => 2

[1,1,1,1,0,1,0,0,0,0] => 1

[1,1,1,1,1,0,0,0,0,0] => 1

[1,0,1,0,1,0,1,0,1,0,1,0] => 0

[1,0,1,0,1,0,1,0,1,1,0,0] => 1

[1,0,1,0,1,0,1,1,0,0,1,0] => 2

[1,0,1,0,1,0,1,1,0,1,0,0] => 1

[1,0,1,0,1,0,1,1,1,0,0,0] => 1

[1,0,1,0,1,1,0,0,1,0,1,0] => 2

[1,0,1,0,1,1,0,0,1,1,0,0] => 3

[1,0,1,0,1,1,0,1,0,0,1,0] => 2

[1,0,1,0,1,1,0,1,0,1,0,0] => 1

[1,0,1,0,1,1,0,1,1,0,0,0] => 2

[1,0,1,0,1,1,1,0,0,0,1,0] => 2

[1,0,1,0,1,1,1,0,0,1,0,0] => 2

[1,0,1,0,1,1,1,0,1,0,0,0] => 1

[1,0,1,0,1,1,1,1,0,0,0,0] => 1

[1,0,1,1,0,0,1,0,1,0,1,0] => 2

[1,0,1,1,0,0,1,0,1,1,0,0] => 3

[1,0,1,1,0,0,1,1,0,0,1,0] => 4

[1,0,1,1,0,0,1,1,0,1,0,0] => 3

[1,0,1,1,0,0,1,1,1,0,0,0] => 3

[1,0,1,1,0,1,0,0,1,0,1,0] => 2

[1,0,1,1,0,1,0,0,1,1,0,0] => 3

[1,0,1,1,0,1,0,1,0,0,1,0] => 2

[1,0,1,1,0,1,0,1,0,1,0,0] => 1

[1,0,1,1,0,1,0,1,1,0,0,0] => 2

[1,0,1,1,0,1,1,0,0,0,1,0] => 3

[1,0,1,1,0,1,1,0,0,1,0,0] => 3

[1,0,1,1,0,1,1,0,1,0,0,0] => 2

[1,0,1,1,0,1,1,1,0,0,0,0] => 2

[1,0,1,1,1,0,0,0,1,0,1,0] => 2

[1,0,1,1,1,0,0,0,1,1,0,0] => 3

[1,0,1,1,1,0,0,1,0,0,1,0] => 3

[1,0,1,1,1,0,0,1,0,1,0,0] => 2

[1,0,1,1,1,0,0,1,1,0,0,0] => 3

[1,0,1,1,1,0,1,0,0,0,1,0] => 2

[1,0,1,1,1,0,1,0,0,1,0,0] => 2

[1,0,1,1,1,0,1,0,1,0,0,0] => 1

[1,0,1,1,1,0,1,1,0,0,0,0] => 2

>>> Load all 1200 entries. <<<

search for individual values

searching the database for the individual values of this statistic

/ search for generating function

searching the database for statistics with the same generating function

click to show known generating functions

Description

The number of non-final maximal constant sub-paths of length greater than one.
This is the total number of occurrences of the patterns $110$ and $001$.

References

[1] Sulanke, R. A. Catalan path statistics having the Narayana distribution MathSciNet:1603692 DOI:10.1016/s0012-365x(97)00126-x

Code

def statistic(x):
    return sum(1 for i in range(len(x)-2) if x[i:i+3] in [[1,1,0], [0,0,1]])

Created

Dec 18, 2015 at 17:59 by Veronica Waite

Updated

Feb 19, 2020 at 16:01 by Martin Rubey