From Surf Wiki (app.surf) — the open knowledge base
Fractal sequence
Sequence that contains itself as a subsequence
Sequence that contains itself as a subsequence
In mathematics, a fractal sequence is one that contains itself as a proper subsequence. An example is
::1, 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 actually, the original sequence contains not only one copy of itself, but rather, infinitely many.
Definition
The precise definition of fractal sequence depends on a preliminary definition: a sequence x = (xn) is an infinitive sequence if for every i,
::(F1) xn = i for infinitely many n.
Let a(i,j) be the jth index n for which xn = i. An infinitive sequence x is a fractal sequence if two additional conditions hold:
::(F2) if i+1 = xn, then there exists *m
Ask Mako anything about Fractal sequence — get instant answers, deeper analysis, and related topics.
Research with MakoFree with your Surf account
Create a free account to save articles, ask Mako questions, and organize your research.
Sign up freeThis content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.
Report