OFFSET
1,3
COMMENTS
If you delete the first occurrence of each n, the remaining sequence is the original sequence; thus the sequence contains itself as a proper subsequence (infinitely many times).
REFERENCES
Clark Kimberling, Interspersions and fractal sequences associated with fractions (c^j)/(d^k), Journal of Integer Sequences 10 (2007, Article 07.5.1) 1-8.
LINKS
C. Kimberling, Fractal Sequences.
FORMULA
a(n)=number of the row of array A125150 that contains n.
EXAMPLE
1 is in row 1 of A125150; 2 in row 1; 3 in row 2;
4 in row 1; 5 in row 3; 6 in row 4, so the fractal
sequence starts with 1,1,2,1,3,4
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, Nov 21 2006
STATUS
approved