Identifier
- St000167: Ordered trees ⟶ ℤ
Values
=>
Cc0021;cc-rep
[[]]=>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
[[],[[[],[],[]]]]=>4
[[],[[[],[[]]]]]=>3
[[],[[[[]],[]]]]=>3
[[],[[[[],[]]]]]=>3
[[],[[[[[]]]]]]=>2
[[[]],[],[],[],[]]=>5
[[[]],[],[],[[]]]=>4
[[[]],[],[[]],[]]=>4
[[[]],[],[[],[]]]=>4
[[[]],[],[[[]]]]=>3
[[[]],[[]],[],[]]=>4
[[[]],[[]],[[]]]=>3
[[[]],[[],[]],[]]=>4
[[[]],[[[]]],[]]=>3
[[[]],[[],[],[]]]=>4
[[[]],[[],[[]]]]=>3
[[[]],[[[]],[]]]=>3
[[[]],[[[],[]]]]=>3
[[[]],[[[[]]]]]=>2
[[[],[]],[],[],[]]=>5
[[[[]]],[],[],[]]=>4
[[[],[]],[],[[]]]=>4
[[[[]]],[],[[]]]=>3
[[[],[]],[[]],[]]=>4
[[[[]]],[[]],[]]=>3
[[[],[]],[[],[]]]=>4
[[[],[]],[[[]]]]=>3
[[[[]]],[[],[]]]=>3
[[[[]]],[[[]]]]=>2
[[[],[],[]],[],[]]=>5
[[[],[[]]],[],[]]=>4
[[[[]],[]],[],[]]=>4
[[[[],[]]],[],[]]=>4
[[[[[]]]],[],[]]=>3
[[[],[],[]],[[]]]=>4
[[[],[[]]],[[]]]=>3
[[[[]],[]],[[]]]=>3
[[[[],[]]],[[]]]=>3
[[[[[]]]],[[]]]=>2
[[[],[],[],[]],[]]=>5
[[[],[],[[]]],[]]=>4
[[[],[[]],[]],[]]=>4
[[[],[[],[]]],[]]=>4
[[[],[[[]]]],[]]=>3
[[[[]],[],[]],[]]=>4
[[[[]],[[]]],[]]=>3
[[[[],[]],[]],[]]=>4
[[[[[]]],[]],[]]=>3
[[[[],[],[]]],[]]=>4
[[[[],[[]]]],[]]=>3
[[[[[]],[]]],[]]=>3
[[[[[],[]]]],[]]=>3
[[[[[[]]]]],[]]=>2
[[[],[],[],[],[]]]=>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
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 leaves of an ordered tree.
This is the number of nodes which do not have any children.
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
May 20, 2016 at 21:19 by Martin Rubey
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!