Identifier
-
Mp00199:
Dyck paths
—prime Dyck path⟶
Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00034: Dyck paths —to binary tree: up step, left tree, down step, right tree⟶ Binary trees
St000118: Binary trees ⟶ ℤ
Values
[1,0] => [1,1,0,0] => [1,1,1,0,0,0] => [[[.,.],.],.] => 0
[1,0,1,0] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [[[.,[.,.]],.],.] => 0
[1,1,0,0] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [[[[.,.],.],.],.] => 0
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [[[.,[.,[.,.]]],.],.] => 1
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [[[.,[[.,.],.]],.],.] => 0
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [[[[.,.],[.,.]],.],.] => 0
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [[[[.,[.,.]],.],.],.] => 0
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [[[[[.,.],.],.],.],.] => 0
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [[[.,[.,[.,[.,.]]]],.],.] => 2
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [[[.,[.,[[.,.],.]]],.],.] => 1
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => [[[.,[[.,.],[.,.]]],.],.] => 1
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => [[[.,[[.,[.,.]],.]],.],.] => 0
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [[[.,[[[.,.],.],.]],.],.] => 0
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [[[[.,.],[.,[.,.]]],.],.] => 1
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [[[[.,.],[[.,.],.]],.],.] => 0
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [[[[.,[.,.]],[.,.]],.],.] => 0
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [[[[.,[.,[.,.]]],.],.],.] => 1
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [[[[.,[[.,.],.]],.],.],.] => 0
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [[[[[.,.],.],[.,.]],.],.] => 0
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [[[[[.,.],[.,.]],.],.],.] => 0
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [[[[[.,[.,.]],.],.],.],.] => 0
[1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [[[[[[.,.],.],.],.],.],.] => 0
[1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,1,0,0,0] => [[[.,[.,[.,[.,[.,.]]]]],.],.] => 3
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,0,1,1,0,0,0,0] => [[[.,[.,[.,[[.,.],.]]]],.],.] => 2
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,0,1,1,0,0,1,0,0,0] => [[[.,[.,[[.,.],[.,.]]]],.],.] => 2
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,0,1,1,0,1,0,0,0,0] => [[[.,[.,[[.,[.,.]],.]]],.],.] => 1
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,0,1,1,1,0,0,0,0,0] => [[[.,[.,[[[.,.],.],.]]],.],.] => 1
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,1,0,0,0] => [[[.,[[.,.],[.,[.,.]]]],.],.] => 2
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,1,1,0,0,0,0] => [[[.,[[.,.],[[.,.],.]]],.],.] => 1
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,1,0,1,0,0,1,0,0,0] => [[[.,[[.,[.,.]],[.,.]]],.],.] => 1
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,1,0,0,0,0] => [[[.,[[.,[.,[.,.]]],.]],.],.] => 1
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,1,0,1,1,0,0,0,0,0] => [[[.,[[.,[[.,.],.]],.]],.],.] => 0
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [1,1,1,0,1,1,1,0,0,0,1,0,0,0] => [[[.,[[[.,.],.],[.,.]]],.],.] => 1
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [1,1,1,0,1,1,1,0,0,1,0,0,0,0] => [[[.,[[[.,.],[.,.]],.]],.],.] => 0
[1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [1,1,1,0,1,1,1,0,1,0,0,0,0,0] => [[[.,[[[.,[.,.]],.],.]],.],.] => 0
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [1,1,1,0,1,1,1,1,0,0,0,0,0,0] => [[[.,[[[[.,.],.],.],.]],.],.] => 0
[1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,1,0,0,0] => [[[[.,.],[.,[.,[.,.]]]],.],.] => 2
[1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [1,1,1,1,0,0,1,0,1,1,0,0,0,0] => [[[[.,.],[.,[[.,.],.]]],.],.] => 1
[1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,1,0,0,1,0,0,0] => [[[[.,.],[[.,.],[.,.]]],.],.] => 1
[1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => [1,1,1,1,0,0,1,1,0,1,0,0,0,0] => [[[[.,.],[[.,[.,.]],.]],.],.] => 0
[1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [1,1,1,1,0,0,1,1,1,0,0,0,0,0] => [[[[.,.],[[[.,.],.],.]],.],.] => 0
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,1,0,0,0] => [[[[.,[.,.]],[.,[.,.]]],.],.] => 1
[1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => [1,1,1,1,0,1,0,0,1,1,0,0,0,0] => [[[[.,[.,.]],[[.,.],.]],.],.] => 0
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,1,0,0,1,0,0,0] => [[[[.,[.,[.,.]]],[.,.]],.],.] => 1
[1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,1,0,0,0,0] => [[[[.,[.,[.,[.,.]]]],.],.],.] => 2
[1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,0,1,1,0,0,0,0,0] => [[[[.,[.,[[.,.],.]]],.],.],.] => 1
[1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [1,1,1,1,0,1,1,0,0,0,1,0,0,0] => [[[[.,[[.,.],.]],[.,.]],.],.] => 0
[1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => [1,1,1,1,0,1,1,0,0,1,0,0,0,0] => [[[[.,[[.,.],[.,.]]],.],.],.] => 1
[1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => [1,1,1,1,0,1,1,0,1,0,0,0,0,0] => [[[[.,[[.,[.,.]],.]],.],.],.] => 0
[1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,1,1,0,1,1,1,0,0,0,0,0,0] => [[[[.,[[[.,.],.],.]],.],.],.] => 0
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,1,0,0,0] => [[[[[.,.],.],[.,[.,.]]],.],.] => 1
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [1,1,1,1,1,0,0,0,1,1,0,0,0,0] => [[[[[.,.],.],[[.,.],.]],.],.] => 0
[1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [1,1,1,1,1,0,0,1,0,0,1,0,0,0] => [[[[[.,.],[.,.]],[.,.]],.],.] => 0
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,1,0,0,0,0] => [[[[[.,.],[.,[.,.]]],.],.],.] => 1
[1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [1,1,1,1,1,0,0,1,1,0,0,0,0,0] => [[[[[.,.],[[.,.],.]],.],.],.] => 0
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,1,1,1,0,1,0,0,0,1,0,0,0] => [[[[[.,[.,.]],.],[.,.]],.],.] => 0
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [1,1,1,1,1,0,1,0,0,1,0,0,0,0] => [[[[[.,[.,.]],[.,.]],.],.],.] => 0
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,1,0,0,0,0,0] => [[[[[.,[.,[.,.]]],.],.],.],.] => 1
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [1,1,1,1,1,0,1,1,0,0,0,0,0,0] => [[[[[.,[[.,.],.]],.],.],.],.] => 0
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,1,1,1,1,0,0,0,0,1,0,0,0] => [[[[[[.,.],.],.],[.,.]],.],.] => 0
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [1,1,1,1,1,1,0,0,0,1,0,0,0,0] => [[[[[[.,.],.],[.,.]],.],.],.] => 0
[1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,1,1,1,1,1,0,0,1,0,0,0,0,0] => [[[[[[.,.],[.,.]],.],.],.],.] => 0
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => [[[[[[.,[.,.]],.],.],.],.],.] => 0
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [[[[[[[.,.],.],.],.],.],.],.] => 0
[] => [1,0] => [1,1,0,0] => [[.,.],.] => 0
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
Description
The number of occurrences of the contiguous pattern [.,[.,[.,.]]] in a binary tree.
oeis:A001006 counts binary trees avoiding this pattern.
oeis:A001006 counts binary trees avoiding this pattern.
Map
to binary tree: up step, left tree, down step, right tree
Description
Return the binary tree corresponding to the Dyck path under the transformation up step - left tree - down step - right tree.
A Dyck path $D$ of semilength $n$ with $ n > 1$ may be uniquely decomposed into $1L0R$ for Dyck paths L,R of respective semilengths $n_1, n_2$ with $n_1 + n_2 = n-1$.
This map sends $D$ to the binary tree $T$ consisting of a root node with a left child according to $L$ and a right child according to $R$ and then recursively proceeds.
The base case of the unique Dyck path of semilength $1$ is sent to a single node.
A Dyck path $D$ of semilength $n$ with $ n > 1$ may be uniquely decomposed into $1L0R$ for Dyck paths L,R of respective semilengths $n_1, n_2$ with $n_1 + n_2 = n-1$.
This map sends $D$ to the binary tree $T$ consisting of a root node with a left child according to $L$ and a right child according to $R$ and then recursively proceeds.
The base case of the unique Dyck path of semilength $1$ is sent to a single node.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!