1592778

Appears in sequences

• Number of non-crossing connected graphs on n nodes on a circle in which a fixed (distinguished) node has degree one.at n=8A089436
• Triangle read by rows: T(n,k) is the number of non-crossing connected graphs on n nodes on a circle in which the root (a distinguished node) has degree k (n >= 2, 1 <= k <= n-1).at n=36A143022