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.
An integer partition is section-sum iff it is possible to choose a disjoint family of strict partitions, one of each of its positive 0-appended differences. These are ranked by A381432.
An integer partition is Look-and-Say iff it is possible to choose a disjoint family of strict partitions, one of each of its multiplicities. These are ranked by A351294.
EXAMPLE
The terms together with their prime indices begin:
12: {1,1,2}
18: {1,2,2}
24: {1,1,1,2}
48: {1,1,1,1,2}
54: {1,2,2,2}
63: {2,2,4}
72: {1,1,1,2,2}
96: {1,1,1,1,1,2}
108: {1,1,2,2,2}
144: {1,1,1,1,2,2}
147: {2,4,4}
162: {1,2,2,2,2}
189: {2,2,2,4}
192: {1,1,1,1,1,1,2}
216: {1,1,1,2,2,2}
288: {1,1,1,1,1,2,2}
324: {1,1,2,2,2,2}
360: {1,1,1,2,2,3}
384: {1,1,1,1,1,1,1,2}
MATHEMATICA
disjointFamilies[y_]:=Select[Tuples[IntegerPartitions/@Length/@Split[y]], UnsameQ@@Join@@#&];
prix[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
conj[y_]:=If[Length[y]==0, y, Table[Length[Select[y, #>=k&]], {k, 1, Max[y]}]];
Select[Range[100], disjointFamilies[prix[#]]!={}&&disjointFamilies[conj[prix[#]]]=={}&]
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, May 18 2025
STATUS
approved
