A367401 Numbers m such that bigomega(m) is not the sum of prime indices of any semiprime divisor of m.
1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 55, 56, 57, 58, 59, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77
Offset: 1
Keywords
Examples
60 has semiprime divisor 10 with prime indices {1,3} summing to 4 = bigomega(60), so 60 is not in the sequence. The terms together with their prime indices begin: 1: {} 2: {1} 3: {2} 5: {3} 6: {1,2} 7: {4} 8: {1,1,1} 9: {2,2} 10: {1,3} 11: {5} 13: {6} 14: {1,4} 15: {2,3} 16: {1,1,1,1} 17: {7} 19: {8} 20: {1,1,3}
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.
Programs
-
Mathematica
prix[n_]:=If[n==1,{}, Flatten[Cases[FactorInteger[n], {p_,k_}:>Table[PrimePi[p],{k}]]]]; Select[Range[100], FreeQ[Total/@Subsets[prix[#],{2}], PrimeOmega[#]]&]
Comments