165942
domain: N
Appears in sequences
- Twice partitioned numbers: the number of ways a number can be partitioned into not necessarily different parts and each part is again so partitioned.at n=18A063834
- 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=8A360716
- Expansion of e.g.f. log(1-x)^2 * (exp(x) - 1) / (2 * (1-x)).at n=8A381108
- 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=27A390896