Identifier
-
Mp00231:
Integer compositions
—bounce path⟶
Dyck paths
Mp00140: Dyck paths —logarithmic height to pruning number⟶ Binary trees
St000128: Binary trees ⟶ ℤ
Values
[1] => [1,0] => [.,.] => 0
[1,1] => [1,0,1,0] => [.,[.,.]] => 0
[2] => [1,1,0,0] => [[.,.],.] => 0
[1,1,1] => [1,0,1,0,1,0] => [.,[.,[.,.]]] => 0
[1,2] => [1,0,1,1,0,0] => [.,[[.,.],.]] => 0
[2,1] => [1,1,0,0,1,0] => [[.,[.,.]],.] => 0
[3] => [1,1,1,0,0,0] => [[.,.],[.,.]] => 0
[1,1,1,1] => [1,0,1,0,1,0,1,0] => [.,[.,[.,[.,.]]]] => 0
[1,1,2] => [1,0,1,0,1,1,0,0] => [.,[.,[[.,.],.]]] => 0
[1,2,1] => [1,0,1,1,0,0,1,0] => [.,[[.,[.,.]],.]] => 0
[1,3] => [1,0,1,1,1,0,0,0] => [.,[[.,.],[.,.]]] => 0
[2,1,1] => [1,1,0,0,1,0,1,0] => [[.,[.,[.,.]]],.] => 0
[2,2] => [1,1,0,0,1,1,0,0] => [[.,[[.,.],.]],.] => 0
[3,1] => [1,1,1,0,0,0,1,0] => [[.,.],[.,[.,.]]] => 0
[4] => [1,1,1,1,0,0,0,0] => [[[.,.],.],[.,.]] => 0
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [.,[.,[.,[.,[.,.]]]]] => 0
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [.,[.,[.,[[.,.],.]]]] => 0
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [.,[.,[[.,[.,.]],.]]] => 1
[1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [.,[.,[[.,.],[.,.]]]] => 0
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [.,[[.,[.,[.,.]]],.]] => 0
[1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [.,[[.,[[.,.],.]],.]] => 0
[1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [.,[[.,.],[.,[.,.]]]] => 0
[1,4] => [1,0,1,1,1,1,0,0,0,0] => [.,[[[.,.],.],[.,.]]] => 0
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [[.,[.,[.,[.,.]]]],.] => 0
[2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [[.,[.,[[.,.],.]]],.] => 0
[2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [[.,[[.,[.,.]],.]],.] => 0
[2,3] => [1,1,0,0,1,1,1,0,0,0] => [[.,[[.,.],[.,.]]],.] => 0
[3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [[.,.],[.,[.,[.,.]]]] => 0
[3,2] => [1,1,1,0,0,0,1,1,0,0] => [[.,.],[.,[[.,.],.]]] => 0
[4,1] => [1,1,1,1,0,0,0,0,1,0] => [[[.,.],.],[.,[.,.]]] => 0
[5] => [1,1,1,1,1,0,0,0,0,0] => [[[.,.],[.,.]],[.,.]] => 0
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [.,[.,[.,[.,[.,[.,.]]]]]] => 0
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [.,[.,[.,[.,[[.,.],.]]]]] => 0
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [.,[.,[.,[[.,[.,.]],.]]]] => 1
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [.,[.,[.,[[.,.],[.,.]]]]] => 0
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [.,[.,[[.,[.,[.,.]]],.]]] => 1
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [.,[.,[[.,[[.,.],.]],.]]] => 1
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [.,[.,[[.,.],[.,[.,.]]]]] => 0
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [.,[.,[[[.,.],.],[.,.]]]] => 0
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [.,[[.,[.,[.,[.,.]]]],.]] => 0
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [.,[[.,[.,[[.,.],.]]],.]] => 0
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [.,[[.,[[.,[.,.]],.]],.]] => 0
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [.,[[.,[[.,.],[.,.]]],.]] => 0
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [.,[[.,.],[.,[.,[.,.]]]]] => 0
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [.,[[.,.],[.,[[.,.],.]]]] => 0
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [.,[[[.,.],.],[.,[.,.]]]] => 0
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [.,[[[.,.],[.,.]],[.,.]]] => 0
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [[.,[.,[.,[.,[.,.]]]]],.] => 0
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [[.,[.,[.,[[.,.],.]]]],.] => 0
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [[.,[.,[[.,[.,.]],.]]],.] => 1
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [[.,[.,[[.,.],[.,.]]]],.] => 0
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [[.,[[.,[.,[.,.]]],.]],.] => 0
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [[.,[[.,[[.,.],.]],.]],.] => 0
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [[.,[[.,.],[.,[.,.]]]],.] => 0
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [[.,[[[.,.],.],[.,.]]],.] => 0
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [[.,.],[.,[.,[.,[.,.]]]]] => 0
[3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [[.,.],[.,[.,[[.,.],.]]]] => 0
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [[.,.],[.,[[.,[.,.]],.]]] => 1
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [[.,.],[.,[[.,.],[.,.]]]] => 0
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [[[.,.],.],[.,[.,[.,.]]]] => 0
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [[[.,.],.],[.,[[.,.],.]]] => 0
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [[[.,.],[.,[.,.]]],[.,.]] => 0
[6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [[[.,.],[.,.]],[[.,.],.]] => 0
[1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [.,[.,[.,[.,[.,[.,[.,.]]]]]]] => 0
[1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [.,[.,[.,[.,[.,[[.,.],.]]]]]] => 0
[1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [.,[.,[.,[.,[[.,[.,.]],.]]]]] => 1
[1,1,1,1,3] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [.,[.,[.,[.,[[.,.],[.,.]]]]]] => 0
[1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [.,[.,[.,[[.,[.,[.,.]]],.]]]] => 1
[1,1,1,2,2] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0] => [.,[.,[.,[[.,[[.,.],.]],.]]]] => 1
[1,1,1,3,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0] => [.,[.,[.,[[.,.],[.,[.,.]]]]]] => 0
[1,1,1,4] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0] => [.,[.,[.,[[[.,.],.],[.,.]]]]] => 0
[1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => [.,[.,[[.,[.,[.,[.,.]]]],.]]] => 1
[1,1,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0] => [.,[.,[[.,[.,[[.,.],.]]],.]]] => 1
[1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0] => [.,[.,[[.,[[.,[.,.]],.]],.]]] => 1
[1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0] => [.,[.,[[.,[[.,.],[.,.]]],.]]] => 1
[1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0] => [.,[.,[[.,.],[.,[.,[.,.]]]]]] => 0
[1,1,3,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0] => [.,[.,[[.,.],[.,[[.,.],.]]]]] => 0
[1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0] => [.,[.,[[[.,.],.],[.,[.,.]]]]] => 0
[1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0] => [.,[.,[[[.,.],[.,.]],[.,.]]]] => 1
[1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0] => [.,[[.,[.,[.,[.,[.,.]]]]],.]] => 0
[1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0] => [.,[[.,[.,[.,[[.,.],.]]]],.]] => 0
[1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0] => [.,[[.,[.,[[.,[.,.]],.]]],.]] => 1
[1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0] => [.,[[.,[.,[[.,.],[.,.]]]],.]] => 0
[1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0] => [.,[[.,[[.,[.,[.,.]]],.]],.]] => 0
[1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [.,[[.,[[.,[[.,.],.]],.]],.]] => 0
[1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0] => [.,[[.,[[.,.],[.,[.,.]]]],.]] => 0
[1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0] => [.,[[.,[[[.,.],.],[.,.]]],.]] => 0
[1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0] => [.,[[.,.],[.,[.,[.,[.,.]]]]]] => 0
[1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0] => [.,[[.,.],[.,[.,[[.,.],.]]]]] => 0
[1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => [.,[[.,.],[.,[[.,[.,.]],.]]]] => 1
[1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => [.,[[.,.],[.,[[.,.],[.,.]]]]] => 0
[1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => [.,[[[.,.],.],[.,[.,[.,.]]]]] => 0
[1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => [.,[[[.,.],.],[.,[[.,.],.]]]] => 0
[1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => [.,[[[.,.],[.,[.,.]]],[.,.]]] => 0
[1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [.,[[[.,.],[.,.]],[[.,.],.]]] => 0
[2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [[.,[.,[.,[.,[.,[.,.]]]]]],.] => 0
[2,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => [[.,[.,[.,[.,[[.,.],.]]]]],.] => 0
[2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0] => [[.,[.,[.,[[.,[.,.]],.]]]],.] => 1
[2,1,1,3] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0] => [[.,[.,[.,[[.,.],[.,.]]]]],.] => 0
[2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => [[.,[.,[[.,[.,[.,.]]],.]]],.] => 1
[2,1,2,2] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0] => [[.,[.,[[.,[[.,.],.]],.]]],.] => 1
>>> Load all 127 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
Description
The number of occurrences of the contiguous pattern [.,[.,[[.,[.,.]],.]]] in a binary tree.
oeis:A159769 counts binary trees avoiding this pattern.
oeis:A159769 counts binary trees avoiding this pattern.
Map
bounce path
Description
The bounce path determined by an integer composition.
Map
logarithmic height to pruning number
Description
Francon's map from Dyck paths to binary trees.
This bijection sends the logarithmic height of the Dyck path, St000920The logarithmic height of a Dyck path., to the pruning number of the binary tree, St000396The register function (or Horton-Strahler number) of a binary tree.. The implementation is a literal translation of Knuth's [2].
This bijection sends the logarithmic height of the Dyck path, St000920The logarithmic height of a Dyck path., to the pruning number of the binary tree, St000396The register function (or Horton-Strahler number) of a binary tree.. The implementation is a literal translation of Knuth's [2].
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!