226856
domain: N
Appears in sequences
- Triangular array read by rows. T(n,k) is the number of partial permutations (injective partial functions) of {1,2,...,n} that have exactly k elements in a cycle. The k elements are not necessarily in the same cycle. A fixed point is considered to be in a cycle.at n=38A206703
- Total number of size 2 lists in all sets of lists partitioning [n] (cf. A000262).at n=8A351825