Representations of it are often shown in color, though technically only a black and white picture accurately portrays one, and even then all its complexity cannot be captured.  
First defined in 1905 by Pierre Fatou, it is now known by the name of the man who wrote the first computer program to view it in 1975.  It can be shown that, if the modulus its recurrence becomes greater than 2, then it will certainly tend towards infinity.  Representations of it are often shown in color, though technically only a black and white picture accurately portrays one, and even then all its complexity cannot be captured.  Generated by the recurrence zn+1 = zn + c [z sub n plus one equals z sub n plus c], name, FTP, this set used to generate fractals.
First defined in 1905 by Pierre Fatou, it is now known by the name of the man who wrote the first computer program to view it in 1975.  
Mandelbrot set