186494

Appears in sequences

• a(n) = T(2n,n), where T is the array in A026148.at n=8A026157
• a(n) = T(n,[ n/2 ]), where T is the array in A026148.at n=16A026162
• Number of non-crossing connected graphs on n nodes on a circle in which a fixed (distinguished) node has degree one.at n=7A089436
• 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=28A143022