A125158 The fractal sequence associated with A125150.

1, 1, 2, 1, 3, 4, 2, 1, 5, 3, 6, 4, 7, 2, 8, 1, 9, 5, 10, 11, 3, 6, 12, 13, 4, 7, 14, 2, 15, 16, 8, 1, 17, 18, 9, 19, 5, 20, 10, 21, 11, 3, 22, 6, 23, 24, 12, 25, 13, 4, 26, 27, 7, 28, 14, 2, 29, 30, 15, 31, 16, 32, 8, 1, 33, 34, 17, 35, 18, 36, 9, 37, 19, 38, 5, 39, 20, 40, 10, 41, 21, 42, 11

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

Table of n, a(n) for n=1..83.

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

Cf. A125150.

Sequence in context: A347296 A341231 A334081 * A273823 A112384 A248514

Adjacent sequences: A125155 A125156 A125157 * A125159 A125160 A125161

Keyword

nonn

Author

Clark Kimberling, Nov 21 2006

Status

approved