46319
domain: N
Appears in sequences
- Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n nodes with exactly k components where each component has at most one cycle; n>=1, 1<=k<=n.at n=22A217756
- Coefficients in the expansion of 1/([r]-[2*r]*x+[3*r]*x^2-...); [ ]=floor, r=sqrt(8/3).at n=18A288233
- Expansion of (1/x) * Series_Reversion( x * (1-x) / (1+x^2)^3 ).at n=8A369262