- FindStat

edit this statistic or download as text // json

Identifier

St000386: 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] => 1

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> 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 factors DDU in a Dyck path.

References

[1] Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n, having k ddu's [here u=(1,1) and d=(1,-1)]. OEIS:A091894

Code

def statistic(D):
    return len(list(Word([0,0,1]).factor_occurrences_in(Word(D))))

Created

Feb 10, 2016 at 14:31 by Martin Rubey

Updated

Jan 11, 2018 at 15:02 by Martin Rubey