508320
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is the number of subpermutations of an n-set whose orbits are each of size at most k, and without fixed points. Equivalently, T(n,k) is the number of partial derangements of an n-set each of whose orbits is of size at most k.at n=41A261762
- Expansion of e.g.f. arctan(log(1 + x)).at n=10A296981