{
\\ PARI/GP script SquareFreeTriplets.gp
\\ Sun, 2014/05/18, 09:00

print("Terms of the sequence f(m) for m = 2,3,...");
default(primelimit,2M);
lb=2; \\ lower bound
ub=2*10^9; \\ upper bound
m=1; \\ number of prime divisors
i=0; \\ 1st member of a triplet
j=0; \\ 2nd
loc=0; \\ local counter
while(m<6,
  m = m+1;
  for(n=lb,ub,
    if(issquarefree(n)&&(m==omega(n)),
      loc = loc+1;
      if(1==loc,
        i=n;
      ); \\ end if(loc
      if(2==loc,
        if(i+1==n,
          j=n;
        ); \\ end if(n
        if(i+1<n,
          loc=1;
          i=n;
        ); \\ end if(n
      ); \\ end if(loc
      if(3==loc,
        if(j+1==n,
          print("f(",m,")=",i);
          lb=i+1;
          loc=0;
          break(1);
        ); \\ end if(n
        if(j+1<n,
          loc=1;
          i=n;
        ); \\ end if(n
      ); \\ end if(loc
    ); \\ end if(issquarefree
  ); \\ end for(n
); \\ end while(m
}