OFFSET
1,3
COMMENTS
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
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 prime indices of 972 are {1,1,2,2,2,2,2}, with section-sum partition (3,3,2,2,2), so a(972) = 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]}]];
Table[If[n==1, 0, Last[egs[prix[n]]]], {n, 100}]
CROSSREFS
KEYWORD
nonn,new
AUTHOR
Gus Wiseman, Feb 28 2025
STATUS
approved