OFFSET
0,5
EXAMPLE
The partition y = (3,3,2,1,1,1) has 2 partitions into sets: {{1},{3},{1,2},{1,3}} and {{1},{1,3},{1,2,3}}, but only the latter has distinct sums, so y is counted under a(11)
The a(1) = 1 through a(10) = 10 partitions (A=10):
1 2 3 4 5 6 7 8 9 A
211 221 411 322 332 441 433
311 2211 331 422 522 442
511 611 711 622
3311 42111 811
32111 3322
4411
32221
43111
52111
MATHEMATICA
hwt[n_]:=Total[Cases[FactorInteger[n], {p_, k_}:>PrimePi[p]*k]];
ssfacs[n_]:=If[n<=1, {{}}, Join@@Table[(Prepend[#, d]&) /@ Select[ssfacs[n/d], Min@@#>d&], {d, Select[Rest[Divisors[n]], SquareFreeQ]}]];
Table[Length[Select[IntegerPartitions[n], Length[Select[ssfacs[Times@@Prime/@#], UnsameQ@@hwt/@#&]]==1&]], {n, 0, 15}]
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Mar 29 2025
STATUS
approved
