1433600

Appears in sequences

• Triangle T(n,k) read by rows: T(n,k) is the number of rooted hypertrees on n labeled vertices with k hyperedges, n >= 2, k >= 1.at n=24A210586
• Consider the e.g.f. D(x,y) = sqrt(1/2) * Sum_{n>=0} Sum_{k=0..2*n} T(n,k) * x^(2*n-k) * y^k / ((2*n-k)!*k!) and related functions S(x,y) and C(x,y), as defined in the Formula section. Sequence gives the triangular array of coefficients T(n,k) (n>=0, 0<=k<=2*n) of D(x,y).at n=73A326802
• Triangle read by rows where T(n,k) is the number of labeled simple connected graphs with n vertices and exactly k bridges.at n=40A327072
• Triangle read by rows: T(n, k) = n^k * n! * [x^k][y^n]((sec(y) + tan(y)) * exp(x*y)).at n=40A376878