Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001098
St001098: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[2]
=> 0
[1,1]
=> 2
[3]
=> 0
[2,1]
=> 5
[1,1,1]
=> 9
[4]
=> 0
[3,1]
=> 16
[2,2]
=> 36
[2,1,1]
=> 46
[1,1,1,1]
=> 64
[5]
=> 0
[4,1]
=> 65
[3,2]
=> 236
[3,1,1]
=> 268
[2,2,1]
=> 405
[2,1,1,1]
=> 497
[1,1,1,1,1]
=> 625
[6]
=> 0
[5,1]
=> 326
[4,2]
=> 1646
[4,1,1]
=> 1776
[3,3]
=> 2658
[3,2,1]
=> 3682
[3,1,1,1]
=> 4218
[2,2,2]
=> 4722
[2,2,1,1]
=> 5532
[2,1,1,1,1]
=> 6526
[1,1,1,1,1,1]
=> 7776
[7]
=> 0
[6,1]
=> 1957
[5,2]
=> 12652
[5,1,1]
=> 13304
[4,3]
=> 28620
[4,2,1]
=> 35529
[4,1,1,1]
=> 39081
[3,3,1]
=> 48364
[3,2,2]
=> 57068
[3,2,1,1]
=> 64432
[3,1,1,1,1]
=> 72868
[2,2,2,1]
=> 77981
[2,2,1,1,1]
=> 89045
[2,1,1,1,1,1]
=> 102097
[1,1,1,1,1,1,1]
=> 117649
[8]
=> 0
[7,1]
=> 13700
[6,2]
=> 107814
[6,1,1]
=> 111728
[5,3]
=> 315486
[5,2,1]
=> 367724
[5,1,1,1]
=> 394332
Description
The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. For a generating function $f$ the associated formal group law is the symmetric function $f(f^{(-1)}(x_1) + f^{(-1)}(x_2), \dots)$, see [1]. This statistic records the coefficient of the monomial symmetric function $m_\lambda$ times the product of the factorials of the parts of $\lambda$ in the formal group law for vertex labelled trees, whose reversal of the generating function $f^{(-1)}(x) = x\exp(-x)$, see [1, sec. 3.3] Fix a set of distinguishable vertices and a coloring of the vertices so that $\lambda_i$ are colored $i$. Then this statistic gives the number of ways of putting a rooted tree on this set of colored vertices so that no leaf is the same color as its parent.