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 (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 A320510.
LINKS
EXAMPLE
The sequence of terms together with their prime indices begins:
1: {}
2: {1}
3: {2}
4: {1,1}
5: {3}
7: {4}
9: {2,2}
11: {5}
13: {6}
15: {2,3}
17: {7}
19: {8}
23: {9}
25: {3,3}
29: {10}
31: {11}
35: {3,4}
37: {12}
41: {13}
43: {14}
MATHEMATICA
primeptn[n_]:=If[n==1, {}, Reverse[Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]]];
Select[Range[100], Greater@@Differences[Append[primeptn[#], 0]]&]
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, May 03 2019
STATUS
approved