OFFSET
0,3
COMMENTS
Conjecture: Also the number of integer partitions of n having a permutation with all distinct run-sums.
EXAMPLE
The partition (3,2,2,2,1) can be partitioned as {{1},{2},{3},{2,2}} or {{1},{3},{2,2,2}}, so is counted under a(10).
The a(1) = 1 through a(7) = 14 partitions:
(1) (2) (3) (4) (5) (6) (7)
(11) (21) (22) (32) (33) (43)
(111) (31) (41) (42) (52)
(1111) (221) (51) (61)
(311) (222) (322)
(2111) (321) (331)
(11111) (411) (421)
(2211) (511)
(3111) (2221)
(21111) (4111)
(111111) (22111)
(31111)
(211111)
(1111111)
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], Select[pfacs[Times@@Prime/@#], UnsameQ@@hwt/@#&]!={}&]], {n, 0, 10}]
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Mar 26 2025
STATUS
approved
