OFFSET
0,3
EXAMPLE
The a(4) = 3 through a(8) = 14 partitions and their unique multiset partition into constant blocks with distinct sums:
{4} {5} {6} {7} {8}
{22} {1}{4} {33} {1}{6} {44}
{1}{3} {2}{3} {1}{5} {2}{5} {1}{7}
{11}{3} {2}{4} {3}{4} {2}{6}
{1}{22} {11}{4} {11}{5} {3}{5}
{2}{111} {11}{22} {1}{33} {11}{6}
{1}{2}{3} {3}{22} {2}{33}
{1}{11}{3} {1}{2}{4} {11}{33}
{3}{1111} {11}{222}
{1}{2}{5}
{1}{3}{4}
{1}{3}{22}
{1}{4}{111}
{1}{111}{22}
MATHEMATICA
hwt[n_]:=Total[Cases[FactorInteger[n], {p_, k_}:>PrimePi[p]*k]];
pfacs[n_]:=If[n<=1, {{}}, Join@@Table[(Prepend[#, d]&)/@Select[pfacs[n/d], Min@@#>=d&], {d, Select[Rest[Divisors[n]], PrimePowerQ]}]];
Table[Length[Select[IntegerPartitions[n], Length[Select[pfacs[Times@@Prime/@#], UnsameQ@@hwt/@#&]]==1&]], {n, 0, 10}]
CROSSREFS
Twice-partitions of this type (constant with distinct) are counted by A279786.
Normal multiset partitions of this type are counted by A382203.
For at least one choice we have A382427.
A050361 counts factorizations into distinct prime powers.
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Mar 26 2025
STATUS
approved
