OFFSET
1,1
COMMENTS
LINKS
Wilmer Emiro Castrillon Calderon, Table of n, a(n) for n = 1..100
MATHEMATICA
f[w_] := Select[Most@ NestWhile[Append[#1, {#2, #2 + #1[[-1, -1]]}] & @@ {#, w[[Length@ # + 1]]} &, {{#, #}} &@ First[w], #[[-1, -1]] <= Max@ w &][[All, -1]], PrimeOmega@ # == 2 &]; Block[{s = Select[Range[10^6], PrimeOmega@ # == 2 &], t}, f@ f@ s] (* Michael De Vlieger, Jan 04 2019 *)
PROG
(C++) typedef unsigned long long int ulli;
void Level3(){ vector<ulli>::iterator low; ulli acum = 0;
for(int i = 0; i < level2.size(); i++){
acum += level2[i];
low=lower_bound (semiprimes.begin(), semiprimes.end(), acum);
if(semiprimes[low - semiprimes.begin()] == acum){
printf("%llu\n", acum);
} } } //where level2 is a vector with A092190.
CROSSREFS
KEYWORD
nonn
AUTHOR
Wilmer Emiro Castrillon Calderon, Jan 03 2019
STATUS
approved