OFFSET
1,1
COMMENTS
The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.
The section-sum partition (A381436) of a multiset or partition y is defined as follows: (1) determine and remember the sum of all distinct parts, (2) remove one instance of each distinct part, (3) repeat until no parts are left. The remembered values comprise the section-sum partition. For example, starting with (3,2,2,1,1) we get (6,3).
Equivalently, the k-th part of the section-sum partition is the sum of all (distinct) parts that appear at least k times. Compare to the definition of the conjugate of a partition, where we count parts >= k.
EXAMPLE
The terms together with their prime indices begin:
6: {1,2}
12: {1,1,2}
18: {1,2,2}
21: {2,4}
24: {1,1,1,2}
30: {1,2,3}
36: {1,1,2,2}
42: {1,2,4}
48: {1,1,1,1,2}
54: {1,2,2,2}
60: {1,1,2,3}
63: {2,2,4}
66: {1,2,5}
70: {1,3,4}
72: {1,1,1,2,2}
78: {1,2,6}
84: {1,1,2,4}
90: {1,2,2,3}
96: {1,1,1,1,1,2}
102: {1,2,7}
105: {2,3,4}
108: {1,1,2,2,2}
MATHEMATICA
prix[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
egs[y_]:=If[y=={}, {}, Table[Total[Select[Union[y], Count[y, #]>=i&]], {i, Max@@Length/@Split[y]}]];
Select[Range[100], !MemberQ[Times@@Prime/@#&/@egs/@IntegerPartitions[Total[prix[#]]], #]&]
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, Feb 27 2025
STATUS
approved