I recognized the pattern shown by BenHem's Asymptote fractal, but from another algorithm: multiplication.
Code:

int w=256,h=256;
int sc = 1;

void setup() {
  size(w,h);
  noLoop();
}

void mouseDragged() {
  sc += mouseX - pmouseX;
  if (sc < 1) sc = 1;
  if (sc > 65535) sc = 0xffff;
  redraw();
}

void draw() {
  loadPixels();
  for (int x=0; x<w; x++) {
    for (int y=0; y<h; y++) {
	pixels[y*w+x] = (x*y*sc) | 0xff000000;  //Colorized
	//pixels[y*w+x] = ((x*y*sc) & 0xff)| 0xff000000;    //this will show only the blue channel
	//pixels[y*w+x] = ((x*y*sc) & 0xff00)| 0xff000000;    //green, and if you pan the mouse quickly you can see what look like standing waves...
    }
  }
  updatePixels();
} 

Interesting -- where did you recognize that fractal from?  Does it have a name?

Yeah, it's the same thing, definitely...
link for those curious to compare:

http://benhem.com/games/afractal/

I really like the formation of the next-level-up (red) fractal yours forms if you continue dragging to the right...I don't have a clear understanding of how yours works -- I think the major (top left) asymptote happens because of the (x*y), but the minor ones  Something to do with the tiers of color jumps in the hex notation