OFFSET
1,2
COMMENTS
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
The differences of a sequence are defined as if the sequence were increasing, so for example the differences of (x, y, z) are (y - x, z - y). We adhere to this standard for integer partitions also even though they are always weakly decreasing. For example, the differences of (6,3,1) (with the last part taken to be 0) are (-3,-2,-1).
The enumeration of these partitions by sum is given by A007294.
This sequence and A025487, considered as sets, are related by the partition conjugation function A122111(.), which maps the members of either set 1:1 onto the other set. - Peter Munn, Feb 10 2022
LINKS
EXAMPLE
The sequence of terms together with their prime indices begins:
1: {}
2: {1}
3: {2}
5: {3}
6: {1,2}
7: {4}
10: {1,3}
11: {5}
13: {6}
14: {1,4}
17: {7}
19: {8}
21: {2,4}
22: {1,5}
23: {9}
26: {1,6}
29: {10}
30: {1,2,3}
31: {11}
33: {2,5}
MATHEMATICA
primeptn[n_]:=If[n==1, {}, Reverse[Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]]];
Select[Range[100], OrderedQ[Differences[Append[primeptn[#], 0]]]&]
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, May 02 2019
STATUS
approved