- FindStat

edit this statistic or download as text // json

Identifier

St000931: Dyck paths ⟶ ℤ

Values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

References

[1] Motzkin numbers: number of ways of drawing any number of nonintersecting chords joining n (labeled) points on a circle. OEIS:A001006

Code

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

Created

Aug 09, 2017 at 14:30 by Christian Stump

Updated

Aug 09, 2017 at 14:30 by Christian Stump