- FindStat

edit this statistic or download as text // json

Identifier

St000660: Dyck paths ⟶ ℤ

Values

[] => 0

[1,0] => 0

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

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

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

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

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

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

[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

>>> Load all 1628 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 rises of length at least 3 of a Dyck path.
The number of Dyck paths without such rises are counted by the Motzkin numbers [1].

References

[1] Catalan number A000108(n) minus Motzkin number A001006(n). OEIS:A153008
[2] Mare Number of certain Dyck paths MathOverflow:256019

Code

def statistic(D):
    return sum( 1 for i in D.rise_composition() if i >= 3 )

Created

Nov 30, 2016 at 20:07 by Christian Stump

Updated

Apr 01, 2018 at 21:35 by Martin Rubey