39796053

Appears in sequences

• Number of unordered pairs of self-avoiding paths whose sets of nodes are disjoint subsets of a set of n points on a circle; one-node paths are not allowed.at n=11A360716
• Triangle read by rows: T(n,k) is the number of sets of noncrossing paths of size k whose nodes are a subset of n nodes arranged in a circle with one node paths disallowed, 0 <= k <= floor(n/2).at n=44A390896