134960
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is the number of partially labeled trees with n nodes, k of which are labeled, 0 <= k <= n.at n=42A034799
- Triangle of number of node labeled trees by number of nodes and number of labels.at n=34A034800
- Number of partially labeled trees with n nodes (6 of which are labeled).at n=2A064785
- Number of pairs of intersecting diagonals in the interior and exterior of a regular n-gon.at n=32A211380
- Number of intersections of diagonals in the interior and exterior of a regular n-gon.at n=32A211383
- Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 2 + 3*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2*x - x^2.at n=48A367297