The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A125159 The fractal sequence associated with A125151. 1
 1, 1, 2, 3, 1, 4, 2, 5, 3, 1, 6, 4, 7, 2, 8, 5, 9, 3, 10, 11, 1, 6, 12, 13, 4, 7, 14, 2, 15, 16, 8, 17, 5, 18, 9, 19, 3, 20, 10, 21, 11, 1, 22, 6, 23, 24, 12, 25, 13, 4, 26, 27, 7, 28, 14, 2, 29, 30, 15, 31, 16, 32, 8, 33, 17, 34, 5, 35, 18, 36, 9, 37, 19, 38, 3, 39, 20, 40, 10, 41, 21, 42 (list; graph; refs; listen; history; text; internal format)
 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 A125151 that contains n. EXAMPLE 1 is in row 1 of A125151; 2 in row 1; 3 in row 2; 4 in row 3; 5 in row 1; 6 in row 4, so the fractal sequence starts with 1,1,2,3,1,4 CROSSREFS Cf. A125151. Sequence in context: A122196 A023117 A023127 * A179548 A023119 A118276 Adjacent sequences:  A125156 A125157 A125158 * A125160 A125161 A125162 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 28 21:04 EDT 2022. Contains 354907 sequences. (Running on oeis4.)