OFFSET
1,1
COMMENTS
First differs from A383514 in lacking 1000.
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 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.
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.
EXAMPLE
The terms together with their prime indices begin:
10: {1,3} 57: {2,8} 94: {1,15}
14: {1,4} 58: {1,10} 95: {3,8}
15: {2,3} 62: {1,11} 100: {1,1,3,3}
22: {1,5} 65: {3,6} 106: {1,16}
26: {1,6} 69: {2,9} 111: {2,12}
33: {2,5} 74: {1,12} 115: {3,9}
34: {1,7} 77: {4,5} 118: {1,17}
35: {3,4} 82: {1,13} 119: {4,7}
38: {1,8} 85: {3,7} 122: {1,18}
39: {2,6} 86: {1,14} 123: {2,13}
46: {1,9} 87: {2,10} 129: {2,14}
51: {2,7} 91: {4,6} 130: {1,3,6}
55: {3,5} 93: {2,11} 133: {4,8}
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 19 2025
STATUS
approved
