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

A386598

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

Terms

    a(0) =1a(1) =8a(2) =18a(3) =16a(4) =70a(5) =60a(6) =182a(7) =450a(8) =636a(9) =1334a(10) =2678a(11) =5352a(12) =4125a(13) =9110a(14) =16450a(15) =83164a(16) =229515a(17) =133872a(18) =655545a(19) =524682a(20) =1051146a(21) =3149706a(22) =4199125a(23) =12583415a(24) =16777995a(25) =50332075a(26) =72271094a(27) =140609062a(28) =402657504a(29) =805309677

External references