For 0<=A, 0<=B, n is an A-almost prime; m is a B-almost prime, k = n+m, k is a C-almost prime; a(n) = smallest number m such that A+B=C.
A059333
For 0<=A, 0<=B, n is an A-almost prime; m is a B-almost prime, k = n+m, k is a C-almost prime; a(n) = smallest number m such that A+B=C.
Terms
- a(0) =2a(1) =1a(2) =3a(3) =23a(4) =5a(5) =2a(6) =2a(7) =73a(8) =1a(9) =2a(10) =3a(11) =52a(12) =2a(13) =1a(14) =3a(15) =227a(16) =5a(17) =14a(18) =2a(19) =44a(20) =1a(21) =5a(22) =2a(23) =232a(24) =1a(25) =2a(26) =1a(27) =4a(28) =5a(29) =66
External references
- oeis: A059333