580317

Appears in sequences

• Set partitions without singletons: number of partitions of an n-set into blocks of size > 1. Also number of cyclically spaced (or feasible) partitions.at n=12A000296
• Let sum(k>=0, k^n/(2*k+1)!) = (x(n)*e + y(n)/e)/z(n), where x(n) and z(n) are >0, then a(n)=x(n).at n=11A080093
• Triangular array read by rows: T(n,k) is the number of set partitions of {1,2,...,n} in which the shortest block has length k (1 <= k <= n).at n=55A178979
• Triangle read by rows, arising in enumeration of permutations by cyclic peaks, cycles and fixed points.at n=37A216963