3299218

Appears in sequences

• Number of (<=2)-covers of an n-set.at n=7A094574
• Number A(n,k) of k-partite partitions of {n}^k into distinct k-tuples; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=47A219585
• Array read by upwards antidiagonals: T(m,n) = number of set partitions into distinct parts of the multiset consisting of one copy each of x_1, x_2, ..., x_m, and two copies each of y_1, y_2, ..., y_n, for m >= 0, n >= 0.at n=35A322770
• Number of partitions of the (n+7)-multiset {1,2,...,n,1,2,...,7} into distinct multisets.at n=7A346900