- FindStat

edit this statistic or download as text // json

Identifier

St000790: 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] => 0

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> 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 pairs of centered tunnels, one strictly containing the other, of a Dyck path.
Apparently, the total number of these is given in [1].
The statistic counting all pairs of distinct tunnels is the area of a Dyck path St000012The area of a Dyck path..

References

[1] oeis A0000245

Code

def statistic(D):
    D = DyckWord(D)
    n = len(D)    
    tunnels = D.tunnels()
    t = [(i, j) for (i, j) in tunnels if i + j == n]
    res = 0
    for (a1, b1) in t:
        for (a2, b2) in t:
            if a1 < a2 < b2 < b1:
                res += 1
    return res

Created

Apr 23, 2017 at 15:11 by Martin Rubey

Updated

Apr 23, 2017 at 15:11 by Martin Rubey