a(n) is the least k such that k + sopfr(k) has exactly n prime factors, counted with multiplicity.

Terms

a(0) =1a(1) =6a(2) =2a(3) =4a(4) =16a(5) =60a(6) =78a(7) =110a(8) =240a(9) =654a(10) =988a(11) =1884a(12) =3681a(13) =20256a(14) =36334a(15) =31269a(16) =58977a(17) =284732a(18) =378638a(19) =767240a(20) =1044328a(21) =2096976a(22) =4164717a(23) =8386433a(24) =15099489a(25) =75412957a(26) =65766673a(27) =122016110a(28) =267863076a(29) =513528686