- FindStat

edit this statistic or download as text // json

Identifier

St000658: Dyck paths ⟶ ℤ

Values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> 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 rises of length 2 of a Dyck path.
This is also the number of $(1,1)$ steps of the associated Łukasiewicz path, see [1].
A related statistic is the number of double rises in a Dyck path, St000024The number of double up and double down steps of a Dyck path..

References

[1] Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k ascents of length 2. OEIS:A102402

Code

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

Created

Nov 30, 2016 at 20:04 by Christian Stump

Updated

Nov 30, 2016 at 20:35 by Martin Rubey