Sequence Fractals Introduction #11


Sierpinski coloring

Up until now, with the exception of the first post in the series, I have been using the sequence part of ‘sequence fractal’ in the iteration formula. Here the iteration is based on the good old z^2+c, but the coloring method incorporates the sequence.

Wikipedia describes a sequence that converges to the Sierpinski Triangle. The link also defines the Sierpinski triangle. The generating sequence has a random component. Each time you generate it you get a different set of numbers, but it always converges to the same set of points.

One such sequence is generated, then the normal fractal iterations starts. At each iteration step a test is done to see if the iteration value, zi is close to the Sierpinski iteration, si. If it is, draw a dot there, the color of the dot depends on the iteration step, opacity is determined by how close.

Sequence Fractals Introduction #8


z^2+c+s_i non-repeating sequence

The sequence is bounded, I know |s_i| < 6. I do not know if the sequence has a limit or a limit cycle.

I could figure that out, just not today. The sequence is generated by a recursive function. Looking at the function I can tell that it is bounded. The software generates the sequence, uses it to generate the picture, but does not print out the values or do any kind of convergence analysis.

I strongly suspect that the sequence converges to a single value.