NonFinalConstantRunsOfLengthAtLeastTwo on DyckPath
Maximal runs of equal steps, at least two long, that are followed by a step of the other kind: the occurrences of two up steps then a down step, or two down steps then an up step.
Called as CombinatorialStat(x, "NonFinalConstantRunsOfLengthAtLeastTwo"). The head's page has its examples.
Live
Distribution
Over DyckPaths at each size, tallied here in your browser; sizes past 10 are not offered.
FindStat St000340
The number of non-final maximal constant sub-paths of length greater than one.
| Object | Value |
|---|---|
[1,0] | 0 |
[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] | 2 |
[1,1,0,1,0,0] | 1 |
[1,1,1,0,0,0] | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000340 has the rest.