Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001376
Mapping
St001376: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[.,.]
 => 0
[.,[.,.]]
 => 1
[[.,.],.]
 => 1
[.,[.,[.,.]]]
 => 3
[.,[[.,.],.]]
 => 3
[[.,.],[.,.]]
 => 0
[[.,[.,.]],.]
 => 3
[[[.,.],.],.]
 => 3
[.,[.,[.,[.,.]]]]
 => 6
[.,[.,[[.,.],.]]]
 => 6
[.,[[.,.],[.,.]]]
 => 3
[.,[[.,[.,.]],.]]
 => 6
[.,[[[.,.],.],.]]
 => 6
[[.,.],[.,[.,.]]]
 => 2
[[.,.],[[.,.],.]]
 => 2
[[.,[.,.]],[.,.]]
 => 2
[[[.,.],.],[.,.]]
 => 2
[[.,[.,[.,.]]],.]
 => 6
[[.,[[.,.],.]],.]
 => 6
[[[.,.],[.,.]],.]
 => 3
[[[.,[.,.]],.],.]
 => 6
[[[[.,.],.],.],.]
 => 6
[.,[.,[.,[.,[.,.]]]]]
 => 10
[.,[.,[.,[[.,.],.]]]]
 => 10
[.,[.,[[.,.],[.,.]]]]
 => 7
[.,[.,[[.,[.,.]],.]]]
 => 10
[.,[.,[[[.,.],.],.]]]
 => 10
[.,[[.,.],[.,[.,.]]]]
 => 6
[.,[[.,.],[[.,.],.]]]
 => 6
[.,[[.,[.,.]],[.,.]]]
 => 6
[.,[[[.,.],.],[.,.]]]
 => 6
[.,[[.,[.,[.,.]]],.]]
 => 10
[.,[[.,[[.,.],.]],.]]
 => 10
[.,[[[.,.],[.,.]],.]]
 => 7
[.,[[[.,[.,.]],.],.]]
 => 10
[.,[[[[.,.],.],.],.]]
 => 10
[[.,.],[.,[.,[.,.]]]]
 => 5
[[.,.],[.,[[.,.],.]]]
 => 5
[[.,.],[[.,.],[.,.]]]
 => 2
[[.,.],[[.,[.,.]],.]]
 => 5
[[.,.],[[[.,.],.],.]]
 => 5
[[.,[.,.]],[.,[.,.]]]
 => 2
[[.,[.,.]],[[.,.],.]]
 => 2
[[[.,.],.],[.,[.,.]]]
 => 2
[[[.,.],.],[[.,.],.]]
 => 2
[[.,[.,[.,.]]],[.,.]]
 => 5
[[.,[[.,.],.]],[.,.]]
 => 5
[[[.,.],[.,.]],[.,.]]
 => 2
[[[.,[.,.]],.],[.,.]]
 => 5
[[[[.,.],.],.],[.,.]]
 => 5
Description
The Colless index of a binary tree. The Colless index is the sum of the absolute values of the differences of the number of leaves in the left and the right subtree over all internal nodes.