Jump to content

Fractal sequence

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Clark Kimberling (talk | contribs) at 21:55, 4 February 2007. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.


In mathematics, a fractal sequence is, loosely speaking, one that contains iself as a proper subsequence. An example is the sequence

   1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6, ...

If the first occurrence of each n is deleted, the remaining sequence is identical to the original. The process can be repeated indefinitely, so that the original sequence contains itself propertly infinitely many times.