- FindStat

edit this statistic or download as text // json

Identifier

St000167: Ordered trees ⟶ ℤ

Values

[[]] => 1

[[],[]] => 2

[[[]]] => 1

[[],[],[]] => 3

[[],[[]]] => 2

[[[]],[]] => 2

[[[],[]]] => 2

[[[[]]]] => 1

[[],[],[],[]] => 4

[[],[],[[]]] => 3

[[],[[]],[]] => 3

[[],[[],[]]] => 3

[[],[[[]]]] => 2

[[[]],[],[]] => 3

[[[]],[[]]] => 2

[[[],[]],[]] => 3

[[[[]]],[]] => 2

[[[],[],[]]] => 3

[[[],[[]]]] => 2

[[[[]],[]]] => 2

[[[[],[]]]] => 2

[[[[[]]]]] => 1

[[],[],[],[],[]] => 5

[[],[],[],[[]]] => 4

[[],[],[[]],[]] => 4

[[],[],[[],[]]] => 4

[[],[],[[[]]]] => 3

[[],[[]],[],[]] => 4

[[],[[]],[[]]] => 3

[[],[[],[]],[]] => 4

[[],[[[]]],[]] => 3

[[],[[],[],[]]] => 4

[[],[[],[[]]]] => 3

[[],[[[]],[]]] => 3

[[],[[[],[]]]] => 3

[[],[[[[]]]]] => 2

[[[]],[],[],[]] => 4

[[[]],[],[[]]] => 3

[[[]],[[]],[]] => 3

[[[]],[[],[]]] => 3

[[[]],[[[]]]] => 2

[[[],[]],[],[]] => 4

[[[[]]],[],[]] => 3

[[[],[]],[[]]] => 3

[[[[]]],[[]]] => 2

[[[],[],[]],[]] => 4

[[[],[[]]],[]] => 3

[[[[]],[]],[]] => 3

[[[[],[]]],[]] => 3

[[[[[]]]],[]] => 2

[[[],[],[],[]]] => 4

[[[],[],[[]]]] => 3

[[[],[[]],[]]] => 3

[[[],[[],[]]]] => 3

[[[],[[[]]]]] => 2

[[[[]],[],[]]] => 3

[[[[]],[[]]]] => 2

[[[[],[]],[]]] => 3

[[[[[]]],[]]] => 2

[[[[],[],[]]]] => 3

[[[[],[[]]]]] => 2

[[[[[]],[]]]] => 2

[[[[[],[]]]]] => 2

[[[[[[]]]]]] => 1

[[],[],[],[],[],[]] => 6

[[],[],[],[],[[]]] => 5

[[],[],[],[[]],[]] => 5

[[],[],[],[[],[]]] => 5

[[],[],[],[[[]]]] => 4

[[],[],[[]],[],[]] => 5

[[],[],[[]],[[]]] => 4

[[],[],[[],[]],[]] => 5

[[],[],[[[]]],[]] => 4

[[],[],[[],[],[]]] => 5

[[],[],[[],[[]]]] => 4

[[],[],[[[]],[]]] => 4

[[],[],[[[],[]]]] => 4

[[],[],[[[[]]]]] => 3

[[],[[]],[],[],[]] => 5

[[],[[]],[],[[]]] => 4

[[],[[]],[[]],[]] => 4

[[],[[]],[[],[]]] => 4

[[],[[]],[[[]]]] => 3

[[],[[],[]],[],[]] => 5

[[],[[[]]],[],[]] => 4

[[],[[],[]],[[]]] => 4

[[],[[[]]],[[]]] => 3

[[],[[],[],[]],[]] => 5

[[],[[],[[]]],[]] => 4

[[],[[[]],[]],[]] => 4

[[],[[[],[]]],[]] => 4

[[],[[[[]]]],[]] => 3

[[],[[],[],[],[]]] => 5

[[],[[],[],[[]]]] => 4

[[],[[],[[]],[]]] => 4

[[],[[],[[],[]]]] => 4

[[],[[],[[[]]]]] => 3

[[],[[[]],[],[]]] => 4

[[],[[[]],[[]]]] => 3

[[],[[[],[]],[]]] => 4

[[],[[[[]]],[]]] => 3

>>> Load all 697 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 leaves of an ordered tree.
This is the number of nodes which do not have any children.

Code

def statistic(t):
    stack = [t]
    nl = 0
    while len(stack)!=0:
        tree = stack.pop()
        if len(tree) == 0:
            nl += 1
        else:
            stack.extend(tree)
    return nl

Created

Nov 09, 2013 at 00:51 by Viviane Pons

Updated

Jul 10, 2024 at 17:29 by Martin Rubey