5201602

Appears in sequences

• Number of connected labeled chordal graphs on n nodes with no induced path P_4; also the number of labeled trees with each vertex replaced by a clique.at n=8A058863
• Triangle read by rows: T(n,k) is the number of labeled quasi-threshold graphs on vertex set [n] with k components, for n >= 1 and 1 <= k <= n.at n=36A350528
• Series expansion of the exponential generating function LambertW(1-exp(x)), see A000169.at n=9A383985