OFFSET
1,1
COMMENTS
MATHEMATICA
prix[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
Select[Range[100], MemberQ[Total/@Subsets[prix[#], {2}], PrimeOmega[#]]&]
CROSSREFS
The following sequences count and rank integer partitions and finite sets according to whether their length is a subset-sum, linear combination, or semi-sum of the parts. The current sequence is starred.
sum-full sum-free comb-full comb-free semi-full semi-free
-----------------------------------------------------------
Triangles:
A365541 counts subsets with a semi-sum k.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Nov 21 2023
STATUS
approved