login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125161 The fractal sequence associated with A125153. 1
1, 2, 3, 1, 4, 2, 5, 6, 7, 3, 8, 9, 1, 10, 4, 11, 12, 13, 14, 2, 15, 5, 16, 17, 6, 18, 19, 7, 20, 3, 21, 22, 23, 8, 24, 25, 26, 9, 27, 1, 28, 29, 10, 30, 4, 31, 32, 11, 33, 34, 12, 35, 36, 13, 37, 38, 14, 39, 40, 2, 41, 42, 43, 15, 44, 45, 46, 5, 16, 47, 48, 17 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

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..72.

C. Kimberling, Fractal Sequences.

FORMULA

a(n)=number of the row of array A125153 that contains n.

EXAMPLE

1 is in row 1 of A125153; 2 in row 2; 3 in row 3;

4 in row 1; 5 in row 4; 6 in row 2, so the fractal

sequence starts with 1,2,3,1,4,2

CROSSREFS

Cf. A125153.

Sequence in context: A336879 A340313 A120873 * A331791 A125933 A255054

Adjacent sequences:  A125158 A125159 A125160 * A125162 A125163 A125164

KEYWORD

nonn

AUTHOR

Clark Kimberling, Nov 21 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 6 04:14 EST 2021. Contains 341841 sequences. (Running on oeis4.)