34250

Appears in sequences

• T(n,k) counts the set partitions of n containing k-1 blocks of length 1.at n=37A086659
• Triangle read by rows: T(n,k) is the number of partitions of an n-set having k singleton blocks (0<=k<=n).at n=56A124323
• Number of 4-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero.at n=28A208598
• Triangle read by rows: T(n,k) = number of partitions of n with k circular successions (n>=0, 0 <= k <= n).at n=56A250104
• Column 1 of triangle in A250104 (or A124323).at n=9A250105
• Number of nX5 0..1 arrays with every element equal to 1, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=7A298709