1,2

As a fractal sequence, A163258 contains every positive integer; indeed, A163258 properly contains itself (infinitely many times).

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

Clark Kimberling, Doubly interspersed sequences, double interspersions and fractal sequences, The Fibonacci Quarterly 48 (2010) 13-20.

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.

Cf. A163253, A163254, A163255, A163256, A163258.

Sequence in context: A274651 A074057 A299756 * A337210 A141063 A138223

Adjacent sequences: A163255 A163256 A163257 * A163259 A163260 A163261

nonn

Clark Kimberling, Jul 24 2009

approved