3539511

Appears in sequences

• Number T(n,k) of permutations of [n] where the minimal distance between elements of the same cycle equals k (k=n for the identity permutation in S_n); triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=56A276974
• Number of permutations of [n] such that the minimal distance between elements of the same cycle equals one, a(1)=1 by convention.at n=9A276975