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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A163258 Fractal sequence of the interspersion A163257. 5
 1, 2, 3, 4, 1, 2, 5, 3, 6, 4, 1, 2, 7, 5, 3, 8, 6, 4, 1, 2, 9, 7, 5, 3, 10, 8, 6, 4, 1, 2, 11, 9, 7, 5, 3, 12, 10, 8, 6, 4, 1, 2, 13, 11, 9, 7, 5, 3, 14, 12, 10, 8, 6, 4, 1, 2, 15, 13, 11, 9, 7, 5, 3, 16, 14, 12, 10, 8, 6, 4, 1, 2, 17, 15, 13, 11, 9, 7, 5, 3, 18, 16, 14, 12, 10, 8, 6, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS As a fractal sequence, A163258 contains every positive integer; indeed, A163258 properly contains itself (infinitely many times). LINKS Clark Kimberling, Doubly interspersed sequences, double interspersions and fractal sequences, The Fibonacci Quarterly 48 (2010) 13-20. EXAMPLE Append the following segments: 1 2 3 4 1 2 5 3 6 4 1 2 7 5 3 8 6 4 1 2 9 7 5 3 10 8 6 4 For n>1, the n-th segment arises from the (n-1)st by inserting 2*n+1 at position 3 and 2*n+2 at position n+3. CROSSREFS Cf. A163253, A163254, A163255, A163256, A163258. Sequence in context: A274651 A074057 A299756 * A337210 A141063 A138223 Adjacent sequences:  A163255 A163256 A163257 * A163259 A163260 A163261 KEYWORD nonn AUTHOR Clark Kimberling, Jul 24 2009 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 July 28 05:59 EDT 2021. Contains 346317 sequences. (Running on oeis4.)