I have adapted the example for the Mandelbrot set in Task and yes, the main problem is breaking up the search. I'll post it when I'm done playing with it. A good example of how many combinations I need to search is C(113,7)=38620298376. Of course, I may need to be a little less ambitious and cut the 113 down some. I'm not sure if Seq will do the job since it seems to compute the full sequence in a parallel manner. I need a parallel version using nextcomb.