42949domain: NAppears in sequencesa(n) = n * [1 + sum(k=1 to n) prime(k)].at n=29A083725Number of partitions p of n such that m(p) <= m(c(p)), where m = minimal multiplicity of parts, and c = conjugate.at n=40A240730MM-numbers of crossing, capturing multiset partitions (with empty parts allowed).at n=31A326259