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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A125158 The fractal sequence associated with A125150. 1
 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 (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 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: A004741 A133923 A334081 * A273823 A112384 A248514 Adjacent sequences:  A125155 A125156 A125157 * A125159 A125160 A125161 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.

Last modified January 18 23:25 EST 2021. Contains 340262 sequences. (Running on oeis4.)